نتایج جستجو برای: prime hyperideal

تعداد نتایج: 43096  

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

Let R be a commutative ring with identity and M be a unitary R-module. Let : S(M) −! S(M) [ {;} be a function, where S(M) is the set of submodules ofM. Suppose n 2 is a positive integer. A proper submodule P of M is called(n − 1, n) − -prime, if whenever a1, . . . , an−1 2 R and x 2 M and a1 . . . an−1x 2P(P), then there exists i 2 {1, . . . , n − 1} such that a1 . . . ai−1ai+1 . . . an−1x 2 P...

The rings considered in this article are commutative with identity $1neq 0$. By a proper ideal of a ring $R$,  we mean an ideal $I$ of $R$ such that $Ineq R$.  We say that a proper ideal $I$ of a ring $R$ is a  maximal non-prime ideal if $I$ is not a prime ideal of $R$ but any proper ideal $A$ of $R$ with $ Isubseteq A$ and $Ineq A$ is a prime ideal. That is, among all the proper ideals of $R$,...

Journal: :international journal of group theory 0
seyed sadegh salehi amiri islamic azad university alireza khalili asboei islamic azad university ali iranmanesh tarbiat modares university abolfazl tehranian islamic azad university

let $g $ be a finite group and let $gamma(g)$ be the prime graph‎ ‎of g‎. ‎assume $2 < q = p^{alpha} < 100$‎. ‎we determine finite groups‎ ‎g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq‎ ‎3‎, ‎5‎, ‎9‎, ‎17$‎, ‎then $u_3(q)$ is quasirecognizable by prime graph‎, ‎i.e‎. ‎if $g$ is a finite group with the same prime graph as the‎ ‎finite simple group $u_3(q)$‎, ‎then $g$ has a un...

Journal: :journal of algorithms and computation 0
r. ponraj department of mathematics, sri paramakalyani college,alwarkurichi-627412, india rajpal singh research scholar, department of mathematics manonmaniam sundaranar university, tirunelveli-627012, india s. sathish narayanan department of mathematics, sri paramakalyani college,alwarkurichi-627412, india

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

Journal: :Bulletin of the Korean Mathematical Society 2002

Journal: :Int. J. Math. Mathematical Sciences 2004
Michiro Kondo

We consider some fundamental properties of QS-algebras and show that (1) the theory of QS-algebras is logically equivalent to the theory of Abelian groups, that is, each theorem of QS-algebras is provable in the theory of Abelian groups, and conversely, each theorem of Abelian groups is provable in the theory of QS-algebras; and (2) a G-part G(X) of a QSalgebra X is a normal subgroup generated ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->