نتایج جستجو برای: reflexive graphs

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

2009
Cristina Bertone Margherita Roggero

It is well known that the Chern classes ci of a rank n vector bundle on P N , generated by global sections, are non-negative if i ≤ n and vanish otherwise. This paper deals with the following question: does the above result hold for the wider class of reflexive sheaves? We show that the Chern numbers ci with i ≥ 4 can be arbitrarily negative for reflexive sheaves of any rank; on the contrary fo...

1999
LAJOS MOLNÁR

Let X be a compact Hausdorff space and let H be a separable Hilbert space. We prove that the group of all order automorphisms of the C∗-algebra C(X)⊗ B(H) is algebraically reflexive.

Journal: :Journal of Intelligent and Fuzzy Systems 2016
Hai-Long Yang Zhi-Lian Guo Yanhong She Xiuwu Liao

Smarandache initiated neutrosophic sets (NSs) which can be used as a mathematical tool for dealing with indeterminate and inconsistent information. In order to apply NSs conveniently, single valued neutrosophic sets (SVNSs) were proposed by Wang et al. In this paper, we propose single valued neutrosophic relations (SVNRs) and study their properties. The notions of anti-reflexive kernel, symmetr...

Journal: :Electronic Notes in Discrete Mathematics 2008
Anton Dochtermann

We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×homotopy is characterized by the topological properties of the Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; Hom complexes were introduced by Lovász and further studied ...

Journal: :Eur. J. Comb. 2009
Anton Dochtermann

We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×homotopy is characterized by the topological properties of the Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; Hom complexes were introduced by Lovász and further studied ...

Journal: :Des. Codes Cryptography 2012
Hyonju Yu

In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [−1− √ 2,−2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [α1,−1− √ 2) where α1 is the smallest root(≈ −2.4812) of the polynomial x3 + 2x2 − 2x − 2. From these results, we ...

2017
Sapna Mehta

iv Acknowledgements v List of Tables vii List of Graphs vii

2008
Arvind Gupta Pavol Hell Mehdi Karimi Arash Rafiey

For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If moreover each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), is the following problem. Given an input digraph G, ...

Journal: :Journal of Pure and Applied Algebra 2021

We show that the category of internal groupoids in an exact Mal'tsev is reflective, and fact a Birkhoff subcategory simplicial objects. then characterize central extensions corresponding Galois structure, regular epimorphisms admit relative monotone-light factorization system sense Chikhladze. also draw some comparison with Kan complexes. By comparing reflections objects reflexive graphs into g...

2009
Chaoyan Wang

................................................................................................................................................. 3 Acknowledgements................................................................................................................................ 6 List of Tables...........................................................................................

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

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

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