نتایج جستجو برای: labelling of graphs

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

Journal: :bulletin of the iranian mathematical society 2015
i. ahmad p. m. higgins

bandwidth labelling is a well known research area in graph theory. we provide a new proof that the bandwidth of mobius ladder is 4, if it is not a $k_{4}$, and investigate the bandwidth of a wider class of mobius graphs of even strips.

متن کامل
Journal: Bulletin of the Iranian Mathematical Society 2015
I. Ahmad, P. M. Higgins,

Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

متن کامل
Journal: :Mapana - Journal of Sciences 2012

متن کامل
Journal: :Electronic Notes in Discrete Mathematics 2009
Júlio Araújo Nathann Cohen Frédéric Giroire Frédéric Havet

A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one (u, v)-path with non-decreasing labels. This notion was introduced in [3] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of graphs that admit a good edge-labelling. First, we exhibit infini...

متن کامل
Journal: :Electronic Notes in Discrete Mathematics 2009

متن کامل
Journal: :Nature 1985

متن کامل
Journal: :Electronic Proceedings in Theoretical Computer Science 2013

متن کامل
Journal: :International Journal of Innovative Research in Science, Engineering and Technology 2020

متن کامل
پایان نامه :دانشگاه تربیت معلم - سبزوار - دانشکده ریاضی و کامپیوتر 1390
ریحانه فوجی, علی اکبر استاجی, لیلا شریفان,

همچنین با استفاده از نتیجه های به دست آمده الگوریتم هایی برای امتحان یکتایی رنگ پذیری ارائه داده شد. به عنوان یک کاربرد، مثال نقضی را برای حدس ژو، مربوط به ‎3-‎رنگ پذیری یکتای گراف های بدون مثلث بررسی می کنیم ‎ایده ی اصلی این پایان نامه از مقاله ‎‎c‎. ‎hillar‎, ‎t‎. ‎windfeldt‎, ‎it algebraic characterization of uniquely vertex colorable graphs, ‎j‎. ‎combin‎. ‎theory ser‎. ‎b 98 (2008) 400...

15 صفحه اول
2013
Nicolas Oury Michael Pedersen Rasmus L. Petersen

We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an exten...

متن کامل

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

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

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