Results 261 to 270 of about 14,864 (300)
Some of the next articles are maybe not open access.
CONNECTED dr-POWER DOMINATING SETS IN GRAPHS
Advances and Applications in Discrete Mathematics, 2018Summary: Let \(G\) be a simple graph. A set \(P\subseteq V(G)\) is called a connected \(dr\)-power dominating set of \(G\) if it is a \(dr\)-power dominating set and the induced subgraph of \(P\), denoted by \(\langle P\rangle\), is connected. The minimum cardinality of a connected \(dr\)-power dominating set \(P\) of a graph \(G\), denoted by \(\gamma^
Cabahug, Isagani S. jun. +1 more
openaire +2 more sources
Connected dominating sets and connected domination polynomials of square of centipedes
Journal of Information and Optimization Sciences, 2016AbstractLet G be a simple connected graph. The connected domination polynomial of G is defined by , where γd(G) is the connected domination number of G. In this paper, we find the connected dominating sets of and a recursive formula is obtained. Also, we construct the connected domination polynomial of and some interesting properties between the ...
A. Vijayan, M. Felix Nes Mabel
openaire +1 more source
Solving Connected Dominating Set Faster than 2 n
Algorithmica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fomin, Fedor V. +2 more
openaire +1 more source
GRASP for connected dominating set problems
Neural Computing and Applications, 2016The minimum connected dominating set problem, a variant of the classical minimum dominating set problem, is a very significant NP-hard combinatorial optimization problem with a number of applications. To address this problem, a greedy randomized adaptive search procedure (GRASP) that incorporates a novel local search procedure based on greedy function ...
Ruizhi Li +5 more
openaire +1 more source
ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
Discrete Mathematics, Algorithms and Applications, 2011Connected dominating set (CDS) has been proposed as the virtual backbone to alleviate the broadcasting storm in wireless sensor network. Most recent research has extensively focused on the construction of connected dominating set. However, the nodes in the CDS need to dominate all its neighbors, and then some nodes cover a large number of neighboring ...
Shang, Weiping, Wang, Xiumei
openaire +2 more sources
Connected Total Dominating Sets and Connected Total Domination Polynomials of Square of Paths
International Journal of Mathematics Trends and Technology, 2014Let G be a simple connected graph of order n. Let Dct(G, i) be the family of connected total dominating sets in G with cardinality i. The polynomial Dct (G, x) = n i (G) ct dct (G, i) x is called the connected total domination polynomial of G. In this paper, we obtain a recursive formula for dct ( 2 n P , i).
A Vijayan, T. Anitha Baby
openaire +1 more source
Connected Dominating Set in Wireless Networks
2013In a graph G D .V;E/, a subset C of vertices is called a Connected Dominating Set if every vertex is either in C or adjacent to a vertex in C , and in addition the subgraph induced by C is connected. Given a graph, finding the minimum Connected Dominating Set is a classical combinatorial optimization problem, existing in literature for a long time. Due
Hongjie Du +5 more
openaire +1 more source
Distributed Dominating Set and Connected Dominating Set Construction Under the Dynamic SINR Model
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2019This paper investigates distributed Dominating Set (DS) and Connected Dominating Set (CDS) construction in dynamic wireless networks under the SINR interference model. Specifically, we present a new model for dynamic networks that admits both churns (due to node arrivals/departures) and node mobility.
Dongxiao Yu +7 more
openaire +1 more source
Optimal Algorithm for Connected Dominating Sets
2012There is no infrastructure in most energy constrained networks, such as WSN. Connected Dominating Set (CDS) has been proposed as virtual backbone. The CDS pays the way for routing, data aggregation and activity scheduling. In order to reduce the backbone size and prolong the lifetime of networks, it is desirable to construct a Minimum CDS (MCDS ...
Nannan Zhao, Muqing Wu
openaire +1 more source
VERY EXCELLENT DOMINATING WEAKLY CONNECTED SET DOMINATING SETS
Advances in Mathematics: Scientific Journal, 2020D. Anandha Selvam +1 more
openaire +1 more source