Results 41 to 50 of about 488,070 (310)
Some results on domination in annihilating-ideal graphs of commutative rings [PDF]
Journal of Hyperstructures. Let R be a commutative ring with identity and A(R) be the set of all ideals of R with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A∗(R) = A(R)\{(0)} and two distinct vertices I and J are ...
Reza Taheri
doaj +1 more source
Approximating Minimum Independent Dominating Sets in Wireless Networks [PDF]
, 2007 We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth.
Hurink, J.L., Nieberg, T.
core +6 more sources
On the complexity of some hop domination parameters
Electronic Journal of Graph Theory and Applications, 2019 A hop Roman dominating function (HRDF) on a graph G = (V, E) is a function f : V → {0, 1, 2} having the property that for every vertex v ∈ V with f(v) = 0 there is a vertex u with f(u) = 2 and d(u, v) = 2. The weight of an HRDF f is the sum of its values
Nader Jafari Rad, Elahe Shabani
doaj +1 more source
Connected Dominating Sets [PDF]
, 2009 Wireless sensor networks (WSNs) are now widely used in many applications. However, routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks. The concept of hierarchical routing is widely used to perform energy-efficient routing in WSNs.
Yiwei Wu, Yingshu Li
openaire +1 more source
Efficient and Perfect domination on circular-arc graphs [PDF]
, 2015 Given a graph $G = (V,E)$, a \emph{perfect dominating set} is a subset of vertices $V' \subseteq V(G)$ such that each vertex $v \in V(G)\setminus V'$ is dominated by exactly one vertex $v' \in V'$.
Lin, Min Chih +2 more
core +2 more sources
, 2016 This paper is devoted to the online dominating set problem and its variants on trees, bipartite, bounded-degree, planar, and general graphs, distinguishing between connected and not necessarily connected graphs. We believe this paper represents the first
Boyar, Joan +4 more
core +2 more sources
Eternal Domination: Criticality and Reachability
Discussiones Mathematicae Graph Theory, 2017 We show that for every minimum eternal dominating set, D, of a graph G and every vertex v ∈ D, there is a sequence of attacks at the vertices of G which can be defended in such a way that an eternal dominating set not containing v is reached.
Klostermeyer William F. +1 more
doaj +1 more source
Super Dominating Sets in Graphs [PDF]
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2015 7 pages, 4 ...
Lemańska, M. +3 more
openaire +3 more sources
Distributed Dominating Set Approximations beyond Planar Graphs
, 2019 The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there ...
Amiri, Saeed Akhoondian +2 more
core +1 more source
Power domination in maximal planar graphs [PDF]
, 2019 Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.
Dorbec, Paul +2 more
core +2 more sources