Results 31 to 40 of about 14,864 (300)
Post-disaster reconstruction algorithm of wireless ad hoc network in coal mine
Gong-kuang zidonghua, 2022 Mine accidents often lead to partial communication link damage and communication network connectivity deterioration. Using residual nodes and limited new nodes, reconstructing coal mine rescue network by constructing local virtual backbone network can ...
HU Qingsong, WANG Shengnan
doaj +1 more source
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 Linear Kernel for Planar Total Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A total dominating set of a graph $G=(V,E)$ is a subset $D \subseteq V$ such that every vertex in $V$ is adjacent to some vertex in $D$. Finding a total dominating set of minimum size is NP-hard on planar graphs and W[2]-complete on general graphs when ...
Valentin Garnero, Ignasi Sau
doaj +1 more source
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
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
Minimum connected dominating set algorithm based on directed diffusion
Tongxin xuebao, 2008 A new minimum connected dominating set algorithm based on directed diffusion MCDSDD was proposed, which attempted to improve the existed area coverage algorithms through introducing node’s gradient in wireless sensor networks.
LI Ke-qing, CHANG Jin-yi, WANG Jia-nian
doaj +2 more sources
2-connected graphs with small 2-connected dominating sets
Discrete Mathematics, 2003 The main result of the paper is the following. Let \(G\) be a \(2\)-connected graph with \(n\) vertices and minimum degree \(\delta\). Then \(\gamma_2 \leq n(\ln(\delta)/\delta)(1+o_{\delta}(1))\), where \(\gamma_2\) is the minimum size of a \(2\)-connected dominating set of \(G\) and \(o_{\delta}(1)\) denotes a function that tends to 0 as \(\delta ...
Caro, Yair, Yuster, Raphael
openaire +1 more source