نتایج جستجو برای: g regular

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

2010
MAURICE AUSLANDER

Let G be a multiplicative group, K a commutative ring with unit, and K(G) the group ring of G with respect to K. We say that K(G) is regular if given an x in K(G), there is a y in K(G) such that xyx = x. Using a homological characterization of regular rings which was found independently by M. Harada [2, Theorem 5] and the author, we prove that if G is locally finite, then K(G) is regular if and...

In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.

2008
DMITRI I. PANYUSHEV

The ground field k is algebraically closed and of characteristic zero. Throughout, G is a connected and simply connected semisimple algebraic group, g is its Lie algebra, and Φ is the Cartan–Killing form on g; l = rk g. Int g (resp. Aut g) is the group of inner (resp. all) automorphisms of g; N is the nilpotent cone in g. For x ∈ g, z(x) is the centraliser of x in g. Let g = ⊕i∈Zmgi be a period...

2002
Mustafa Atici Zhi-Hong Chen

The integrity of a graph G, I(G), is defined by I(G) = minS⊆V (G){|S| + m(G − S)} where m(G− S) is the maximum order of the components of G− S. In general the integrity of r-regular graph is not known [?]. We answer the following question for special regular graphs. For any given two integers p and r such that pr 2 is an integer, is there a r-regular graph, say G ∗, on p vertices having size q ...

emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.

2017
Paula Carvalho PAULA CARVALHO

A subset of the vertex set of a graph G, S ⊆ V (G), is a (k, τ)-regular set if it induces a k-regular subgraph of G and every vertex not in the subset has τ neighbors in it. This paper is a contribution to the given problem of existence of (k, τ)-regular sets associated with all distinct eigenvalues of integral strongly regular graphs. The minimal idempotents of the Bose-Mesner algebra of stron...

2015
Yair Glasner Bálint Virág

We give an explicit bound on the spectral radius in terms of the densities of short cycles in finite d-regular graphs. It follows that the a finite d-regular Ramanujan graph G contains a negligible number of cycles of size less than c log log |G|. We prove that infinite d-regular Ramanujan unimodular random graphs are trees. Through Benjamini-Schramm convergence this leads to the following rigi...

Journal: :CoRR 2012
Wei-Fan Wang Qiaojun Shu Yiqiao Wang

An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. Fiamčik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that a(G) ≤ ∆ + 2 for any simple graph G with maximum degree ∆. Basavaraju and Chandran (2009) show...

2012
PAULA CARVALHO

A subset of the vertex set of a graph G, S ⊆ V (G), is a (k, τ)-regular set if it induces a k-regular subgraph of G and every vertex not in the subset has τ neighbors in it. This paper is a contribution to the given problem of existence of (k, τ)-regular sets associated with all distinct eigenvalues of integral strongly regular graphs. The minimal idempotents of the Bose-Mesner algebra of stron...

پایان نامه :0 1374

the aim of this study has been to find answers for the following questions: 1. what is the effect of immediate correction on students pronunciation errors? 2. what would be the effect of teaching the more rgular patterns of english pronunciation? 3. is there any significant difference between the two methods of dealing with pronuciation errore, i. e., correction and the teaching of the regular ...

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

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

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"; } -->