Results 61 to 70 of about 252,358 (178)
Weakly connected domination critical graphs [PDF]
Opuscula Mathematica, 2008 A dominating set \(D \subset V(G)\) is a weakly connected dominating set in \(G\) if the subgraph \(G[D]_w = (N_{G}[D],E_w)\) weakly induced by \(D\) is connected, where \(E_w\) is the set of all edges with at least one vertex in \(D\).
Magdalena Lemańska, Agnieszka Patyk
doaj
Strongly connected dominating set construction algorithm balancing time delay and energy consumption
Tongxin xuebao, 2012 To the asymmetry of link in wireless sensor networks,a problem about the strongly connected dominating tree with bounded transmission delay (SDTT) was put forward.The distributed strongly connected dominating tree (SCDT) algorithm was also proposed to ...
Yan-jing SUN +3 more
doaj +2 more sources
Disjoint Secure Domination in the Join of Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G = (V(G),E(G)) be a simple connected graph. A dominating set S in G is called a secure dominating set in G if for every u ∈ V (G) \ S, there exists v ∈ S ∩ NG(u) such that (S \ {v}) ∪ {u} is a dominating set.
Jonecis Dayap, Enrico Enriquez
doaj +1 more source
Rainbow connection number, bridges and radius [PDF]
, 2011 Let $G$ be a connected graph. The notion \emph{the rainbow connection number $rc(G)$} of a graph $G$ was introduced recently by Chartrand et al. Basavaraju et al.
Dong, Jiuying, Li, Xueliang
core
Domination Parameters of a Graph and its Complement
Discussiones Mathematicae Graph Theory, 2018 A dominating set in a graph G is a set S of vertices such that every vertex in V (G) \ S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G.
Desormeaux Wyatt J. +2 more
doaj +1 more source
Characterization of Upper Detour Monophonic Domination Number
Cubo, 2020 This paper introduces the concept of \textit{upper detour monophonic domination number} of a graph. For a connected graph $G$ with vertex set $V(G)$, a set $M\subseteq V(G)$ is called minimal detour monophonic dominating set, if no proper subset of $M ...
M. Mohammed Abdul Khayyoom
doaj +1 more source
On the number of outer connected dominating sets of graphs
, 2012 Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph.
Akhbari, Mohammad H. +2 more
core
A Greedy Algorithm on Constructing the Minimum Connected Dominating Set in Wireless Network
International Journal of Distributed Sensor Networks, 2016 In the past 20 years, the connected dominating set (CDS) as a virtual backbone network has been widely used in the wireless networks. Many researchers have been devoted to designing approximate algorithms for CDS problem since constructing the minimum ...
Deqian Fu +3 more
doaj +1 more source
Connected Partitions via Connected Dominating Sets
The classical theorem due to Győri and Lovász states that any $k$-connected graph $G$ admits a partition into $k$ connected subgraphs, where each subgraph has a prescribed size and contains a prescribed vertex, as long as the total size of target subgraphs is equal to the size of $G$.
Niklanovits, Aikaterini +3 more
openaire +3 more sources
Disjoint Connected Dominating Sets in Pseudorandom Graphs
Proceedings of the 57th Annual ACM Symposium on Theory of Computing10 ...
Nemanja Draganić, Michael Krivelevich
openaire +2 more sources