Results 11 to 20 of about 252,358 (178)
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2011 AbstractThe rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree δ, the rainbow connection number ...
Chandran, L. Sunil +3 more
openaire +4 more sources
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
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
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
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
Dominating Sets and Connected Dominating Sets in Dynamic Graphs [PDF]
, 2019 In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time $O( \cdot \text{polylog}~n)$ per update, where $ $ is the maximum vertex degree in the
Hjuler N. +3 more
openaire +6 more sources
Enumerating Connected Dominating Sets
, 2022 The question to enumerate all inclusion-minimal connected dominating sets in a graph of order $n$ in time significantly less than $2^n$ is an open question that was asked in many places. We answer this question affirmatively, by providing an enumeration algorithm that runs in time $\mathcal{O}(1.9896^n)$, using polynomial space only.
Abu-Khzam, Faisal +4 more
openaire +2 more sources
Approximation algorithms for connected dominating sets [PDF]
Algorithmica, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guha, S., Khuller, S.
openaire +3 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
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