Results 41 to 50 of about 252,358 (178)
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
Bilangan Dominasi Eksentrik Terhubung Pada Graf [PDF]
, 2016 . Given a graph , comprising a set of vertices and a set of edges. A set is a dominating set of , if every vertex in is adjacent to at least one vertex in .
Sumarsono, T. (Tito)
core
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
Efficient Domination in Cayley Graphs of Generalized Dihedral Groups
Discussiones Mathematicae Graph Theory, 2022 An independent subset D of the vertex set V of the graph Γ is an efficient dominating set for Γ if each vertex v ∈ V \ D has precisely one neighbour in D. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which
Caliskan Cafer +3 more
doaj +1 more source
Connected dominating sets on dynamic geometric graphs
Computational Geometry, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guibas, L. +2 more
openaire +2 more sources
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
AlgorithmsIn this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source
Weakly convex and convex domination numbers [PDF]
Opuscula Mathematica, 2004 Two new domination parameters for a connected graph \(G\): the weakly convex domination number of \(G\) and the convex domination number of \(G\) are introduced. Relations between these parameters and the other domination parameters are derived.
Magdalena Lemańska
doaj
Construction of Pipelined Strategic Connected Dominating Set for Mobile Ad Hoc Networks
Journal of Computing and Information Technology, 2016 Efficient routing between nodes is the most important challenge in a Mobile Ad Hoc Network (MANET). A Connected Dominating Set (CDS) acts as a virtual backbone for routing in a MANET.
Ceronmani Sharmila, George Amalanathan
doaj +1 more source
On the Enumeration of Minimal Dominating Sets and Related Notions
, 2014 A dominating set $D$ in a graph is a subset of its vertex set such that each vertex is either in $D$ or has a neighbour in $D$. In this paper, we are interested in the enumeration of (inclusion-wise) minimal dominating sets in graphs, called the Dom-Enum
Kanté, Mamadou Moustapha +3 more
core +3 more sources
International Journal of Distributed Sensor Networks, 2017 The high attenuation of radio signals in water leaves acoustic waves the most viable communication media for underwater sensor networks. Nevertheless, acoustic communication suffers from significantly high latency because of its low propagation speed ...
Xin Bai, Xiaohui Wei, Sen Bai
doaj +1 more source