Results 51 to 60 of about 252,358 (178)
On the edge geodetic and edge geodetic domination numbers of a graph [PDF]
Communications in Combinatorics and Optimization, 2020 In this paper, we study both concepts of geodetic dominating and edge geodetic dominating sets and derive some tight upper bounds on the edge geodetic and the edge geodetic domination numbers.
Vladimir Samodivkin
doaj +1 more source
Constructing Minimum Connected Dominating Set: Algorithmic Approach
International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010 Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices.
G.N. Purohit, Sharma, Usha
openaire +1 more source
Inverse Clique Domination in Graphs
Recoletos Multidisciplinary Research Journal, 2016 Let G be a connected simple graph. A nonempty subset S of the vertex set V (G) is a clique in G if the graph induced by S is complete. A clique S in G is a clique dominating set if it is a dominating set.
Carmelita Loquias +2 more
doaj +1 more source
New bound on MIS and MIN-CDS for a unit ball graph
ICT Express, 2017 The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj +1 more source
Certain Properties of Domination in Product Vague Graphs With an Application in Medicine
Frontiers in Physics, 2021 The product vague graph (PVG) is one of the most significant issues in fuzzy graph theory, which has many applications in the medical sciences today.
Xiaolong Shi, Saeed Kosari
doaj +1 more source
Fast exact algorithms for some connectivity problems parametrized by clique-width
, 2018 Given a clique-width $k$-expression of a graph $G$, we provide $2^{O(k)}\cdot n$ time algorithms for connectivity constraints on locally checkable properties such as Node-Weighted Steiner Tree, Connected Dominating Set, or Connected Vertex Cover. We also
Bergougnoux, Benjamin +1 more
core +2 more sources
International Journal of Distributed Sensor Networks, 2014 Energy efficiency is one of the major issues in wireless sensor networks (WSNs) and their applications. Distributed techniques with low message and time complexities are expected in WSNs. Connected dominating sets (CDSs) have been widely used for virtual
Najla Al-Nabhan +2 more
doaj +1 more source
Exponential Domination in Subcubic Graphs
, 2015 As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduce exponential domination, where vertices are considered to have some dominating power that decreases ...
Bessy, Stéphane +2 more
core +1 more source
Topology Consistency of Disease-specific Differential Co-regulatory Networks
BMC Bioinformatics, 2019 Background Sets of differentially expressed genes often contain driver genes that induce disease processes. However, various methods for identifying differentially expressed genes yield quite different results.
Maryam Nazarieh +2 more
doaj +1 more source
Performance of Connected Dominating Set in OLSR protocol [PDF]
, 2004 We analyze the performance of connected dominating set (CDS)election protocols in wireless ad hoc networks. We compare the dominating set made from MPR and a new connected dominating set (NCDS) protocols issued from a straightforward generalization of ...
Jacquet, Philippe
core +1 more source