Results 21 to 30 of about 5,986,669 (282)
Connected domination value in graphs
Electronic Journal of Graph Theory and Applications, 2021 In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V \ D, there exists u ∈ D such that u and v are adjacent, and the subgraph〈D〉induced by D in G is connected.
Angsuman Das
doaj +1 more source
Energy Efficient Algorithm of Constructing Connected Dominating Set in WSN [PDF]
Jisuanji gongcheng, 2017 The existing methods of constructing Connected Dominating Set (CDS) have some drawbacks,such as redundant steps,much more energy consumption,and not adapting to the changes of dynamic network topology.So this paper proposes an improved algorithm called ...
JI Fusheng,WU Chen,LIU Qiaoshou
doaj +1 more source
Forcing Parameters in Fully Connected Cubic Networks
Mathematics, 2022 Domination in graphs has been extensively studied and adopted in many real life applications. The monitoring electrical power system is a variant of a domination problem called power domination problem.
Yongsheng Rao +4 more
doaj +1 more source
Approximating k-Connected m-Dominating Sets [PDF]
Algorithmica, 2022 A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected $m$-Dominating Set ($(k,m)$-CDS) problem the goal is to find a minimum weight $(k,m)$-cds in a node-weighted graph. For $m
openaire +7 more sources
Perfect Outer-connected Domination in the Join and Corona of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let 𝐺 be a connected simple graph. A dominating set 𝑆 ⊆ 𝑉(𝐺) is called a perfect dominating set of 𝐺 if each 𝑢 ∈ 𝑉 𝐺 ∖ 𝑆 is dominated by exactly one element of 𝑆.
Enrico Enriquez +3 more
doaj +1 more source
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Inverse Domination Parameters of Jump Graph
Ratio Mathematica, 2023 Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D.
S Santha, G.T Krishna Veni
doaj +1 more source
Algorithmic complexity of secure connected domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple, undirected, and connected graph. A connected (total) dominating set is a secure connected (total) dominating set of G, if for each there exists such that and is a connected (total) dominating set of G. The minimum cardinality of a secure
J. Pavan Kumar +2 more
doaj +1 more source
Connected Dominating Sets [PDF]
, 2009 Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs.
Yiwei Wu, Yingshu Li
openaire +1 more source
Long Dominating Cycles in Graphs [PDF]
, 2007 All graphs considered in this paper will be finite and simple.
Zhiren, Sun, Yongga, A.
core +1 more source