Results 31 to 40 of about 252,358 (178)
Connected cototal domination number of a graph [PDF]
Transactions on Combinatorics, 2012 A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices.
B Basavanagoud, Sunilkumar M Hosamani
doaj
A Note on Triple Repetition Sequence of Domination Number in Graphs
InPrime, 2022 A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected. A connected
Leomarich F. Casinillo +2 more
doaj +1 more source
Below All Subsets for Minimal Connected Dominating Set [PDF]
SIAM Journal on Discrete Mathematics, 2018 A vertex subset $S$ in a graph $G$ is a dominating set if every vertex not contained in $S$ has a neighbor in $S$. A dominating set $S$ is a connected dominating set if the subgraph $G[S]$ induced by $S$ is connected. A connected dominating set $S$ is a minimal connected dominating set if no proper subset of $S$ is also a connected dominating set.
Lokshtanov, Daniel +2 more
openaire +3 more sources
Proper connection number and connected dominating sets
Theoretical Computer Science, 2015 The proper connection number $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one path in $G$ such that no two adjacent edges of the path are colored the same, and such a path is called a proper path. In this paper, we show that
Li, Xueliang, Wei, Meiqin, Yue, Jun
openaire +3 more sources
Connected odd dominating sets in graphs [PDF]
Discussiones Mathematicae Graph Theory, 2005 An odd dominating set of a simple, undirected graph G = (V, E) is a set of vertices D ⊆ V such that |N [v]∩D| ≡ 1 mod 2 for all vertices v ∈ V . It is known that every graph has an odd dominating set. In this paper we consider the concept of connected odd dominating sets.
Yair Caro +2 more
openaire +1 more source
Data Aggregation Scheduling Algorithm for Wireless Sensor Network Based on Connected Dominating Set [PDF]
Jisuanji gongcheng, 2016 Data aggregation scheduling aims to find a feasible and efficient data aggregation scheme for Wireless Sensor Network (WSN).Previous algorithms on this problem usually construct data aggregation routing based on shortest-path-trees,which results in data ...
NING Duobiao,ZHANG Bing
doaj +1 more source
Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs
Mathematics, 2022 In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and a weak n-connected total perfect k-dominating set in fuzzy graphs is introduced.
Krishnasamy Elavarasan +3 more
doaj +1 more source
Enumerating Minimal Connected Dominating Sets
SIAM Journal on Discrete MathematicszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faisal Abu-Khzam +4 more
openaire +3 more sources
Improved Route Discovery Based on Constructing Connected Dominating Set in MANET
International Journal of Distributed Sensor Networks, 2015 A mobile ad hoc network (MANET) is widely applied in various urgent scenarios, benefiting from its feature that the hosts can communicate with each other without any physical infrastructure.
Zifen Yang +3 more
doaj +1 more source
Location-domination in line graphs
, 2016 A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the open neighborhood
Foucaud, Florent, Henning, Michael A.
core +3 more sources