نتایج جستجو برای: distance dominating set

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

Journal: : 2023

In this paper, we define fuzzy graph chains, which comprise vertex identification. These graphs are isomorphic graphs, provide that after applying various features to the chain of as special .

Journal: :Discrete Mathematics & Theoretical Computer Science 2006
Mekkia Kouider Preben D. Vestergaard

As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ c (T ) in terms of minimum valency and diameter. For trees the inequality γ c (T ) ≤ n− k − 1 is known to hold, we determine the class o...

Journal: :Discrete Mathematics 2013
K. Reji Kumar Gary MacGillivray

Results about wreath products of circulant graphs are used to construct infinitely many circulant graphswith efficient dominating setswhose elements need not be equally spaced in Zn. It is proved that if a circulant graph of large degree has an efficient dominating set, then either its elements are equally spaced, or the graph is the wreath product of a smaller circulant graph with an efficient...

Journal: :JCM 2016
Qiang Tang Yuansheng Luo Ming-Zhong Xie Ping Li

—In this paper, a Connected Dominating Set (CDS) construction algorithm CSCDS (Connected Subset based CDS) is proposed, which is based on the connected subset concept. The CSCDS contains two main stages, which are dominating set construction stage and connected dominating set construction stage respectively. In the first stage, the dominators are proposed based on the one hop white neighbor in...

Journal: :Discussiones Mathematicae Graph Theory 2004
Maw-Shang Chang Ruo-Wei Hung

A connected dominating set of a graph G = (V, E) is a subset of vertices CD ⊆ V such that every vertex not in CD is adjacent to at least one vertex in CD, and the subgraph induced by CD is connected. We show that, given an arc family F with endpoints sorted, a minimum-cardinality connected dominating set of the circular-arc graph constructed from F can be computed in O(|F |) time.

Journal: :Journal of the Indonesian Mathematical Society 2014

Journal: :Discrete Math., Alg. and Appl. 2009
Xiaofeng Gao Yuexuan Wang Xianyue Li Weili Wu

Connected Dominating Set is widely used as virtual backbone in wireless networks to improve network performance and optimize routing protocols. Based on special characteristics of ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacent if the distance bet...

2008
Xianyue Li Xiaofeng Gao Weili Wu

Connected Dominating Set is widely used as virtual backbone in wireless Ad-hoc and sensor networks to improve the performance of transmission and routing protocols. Based on special characteristics of Ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are said to be adjacen...

Journal: :International Mathematical Forum 2007

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

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