نتایج جستجو برای: hop roman dominating function

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

Journal: :IJCNIS 2009
Guillermo Ibáñez Eva Manzanedo Juan A. Carral Antonio Gracia Jose Mannuel Acro

Currently wireless networks are dominant by star topology paradigm. Its natural the evolution is towards wireless mesh multi-hop networks. This article compares the performance of several algorithms for virtual backbone formation in ad hoc mesh networks both theoretically and through simulations. Firstly, an overview of the algorithms is given. Next, the results of the algorithm simulations mad...

Journal: :Optimization Letters 2010
Xiaofeng Gao Wei Wang Zhao Zhang Shiwei Zhu Weili Wu

In this paper, we design the first polynomial time approximation scheme for d-hop connected dominating set (d-CDS) problem in growth-bounded graphs, which is a general type of graphs including unit disk graph, unit ball graph, etc. Such graphs can represent majority types of existing wireless networks. Our algorithm does not need geometric representation (e.g., specifying the positions of each ...

Journal: :European Journal of Pure and Applied Mathematics 2023

Let G be an undirected connected graph with vertex and edge sets V (G) E(G), respectively. A set C ⊆ is called convex hop dominating if for every two vertices x, y ∈ C, the of x-y geodesic contained in v \ there exists w such that dG(v, w) = 2. The minimum cardinality G, denoted by γconh(G), domination number G. In this paper, we show positive integers a b, where 2 ≤ are realizable as number, r...

2013
ASHER M. KACH

We study, for a countably categorical theory T, the complexity of computing and the complexity of dominating the function specifying the number of n-types consistent with T.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علوم بهزیستی و توانبخشی - دانشکده توانبخشی 1392

هدف: بررسی ارتباط عملکرد عصبی شناختی و توانایی عملکردی ورزشکاران با و بدون بی ثباتی عملکردی مچ پا روش بررسی: 20 ورزشکار با بی ثباتی عملکردی یکطرفه مچ پا و 20 ورزشکار سالم از نظر جنس، نوع و سابقه star excursion فعالیت ورزشی، سن، اندام غالب، قد و وزن جور شدند. توانایی عملکردی با آزمون های ارزیابی شد و عملکرد single hop و side hop ،square hop ،figure-of-8 hop ،balance test عصبی شناختی با آزمون...

2012
Natarajan Meghanathan Michael Terrell

We present a detailed simulation based performance study of our recently proposed strong-neighborhood based connected dominating sets (SN-CDS) for mobile ad hoc networks (MANETs). We compare the performance of SN-CDS with that of the well-known minimum connected dominating sets (MCDS) and the ID-based connected dominating sets (ID-CDS) for MANETs. We show that by computing the SN-CDS involving ...

2005
Hans-Jürgen Schmeisser

Acknowledgements I would like to express my deepest appreciation to my supervisors Professor Hans-Jürgen Schmeisser and Professor Winfried Sickel for their support and many hints and comments. I thank also Professor Hans Triebel for many valuable discussions on the topic of this work.

Journal: :European Journal of Pure and Applied Mathematics 2023

Let $G$ be a connected graph. A set $S$ of vertices in is 1-movable 2-resolving hop dominating if and for every $v \in S$, either $S\backslash \{v\}$ or there exists vertex $u \big((V (G) \backslash S) \cap N_G(v)\big)$ such that $\big(S \{v\}\big) \cup \{u\}$ $G$. The domination number $G$, denoted by $\gamma^{1}_{m2Rh}(G)$ the smallest cardinality In this paper, we investigate concept study i...

2002
Geng Chen Fabian Garcia Nocetti Julio Solano-González Ivan Stojmenovic

In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. We propose to combine two known approaches into a single clustering algorithm which considers connectivity as a primary and lower ID as secondary criterion for selecting clusterheads. The goal is to minimize number of clusters, which leads toward dominating sets of smaller sizes (this is important ...

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

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

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