Results 31 to 40 of about 51,346 (268)
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
DOMINATING SET ON CHAIN OF FUZZY GRAPHS
Tikrit Journal of Pure Science, 2023 In this paper, we define fuzzy graph chains, which comprise vertex identification. These fuzzy graphs are isomorphic fuzzy graphs, provide that after applying various features to the chain of fuzzy graphs, which as special fuzzy graph chain of .
Russel H. Majeed, Nabeel E. Arif
doaj +1 more source
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj +1 more source
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
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
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
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
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
Dominating Sets in Projective Planes [PDF]
Journal of Combinatorial Designs, 2016 AbstractWe describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result that shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a dominating set in a projective plane of order is smaller than (i.e., twice the size of a Baer subplane ...
Héger, Tamás, Nagy, Zoltán Lóránt
openaire +4 more sources