Results 31 to 40 of about 5,986,669 (282)
Positive Influence Dominating Set in E-Learning Social Networks [PDF]
, 2011 In recent years, the development of E-learning is rapid. Learning efficiency can be greatly improved if E-learning users' social networks properties can be effectively utilized. However, the nodes in most research models are the same type.
Hua Wang +7 more
core +1 more source
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
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
Xueliang Li 0001 +2 more
openaire +3 more sources
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
On connected dominating sets of restricted diameter
European Journal of Operational Research, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Austin Buchanan +3 more
openaire +2 more sources
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.
Leomarich F. Casinillo +2 more
doaj +1 more source
The 3-rainbow index and connected dominating sets [PDF]
Journal of Combinatorial Optimization, 2014 23 ...
Qingqiong Cai +2 more
openaire +4 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
Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
Journal of Graph Algorithms and Applications, 2014 A set D ⊆ V of a graph G = (V,E) is called an outer-connected dominating set of G if for all v ∈ V, |NG[v]∩D| ≥ 1, and the induced subgraph of G on V\D is connected.
B. Panda, Arti Pandey
doaj +1 more source