Results 1 to 10 of about 11,106,432 (291)
Domination Number, Independent Domination Number and 2-Independence Number in Trees [PDF]
Discussiones Mathematicae Graph Theory, 2021 For a graph G, let γ(G) be the domination number, i(G) be the independent domination number and β2(G) be the 2-independence number. In this paper, we prove that for any tree T of order n ≥ 2, 4β2(T) − 3γ(T) ≥ 3i(T), and we characterize all trees ...
Dehgardi Nasrin +4 more
doaj +4 more sources
Algorithmic Aspects of the Independent 2-Rainbow Domination Number and Independent Roman {2}-Domination Number [PDF]
Discussiones Mathematicae Graph Theory, 2022 A 2-rainbow dominating function (2RDF) of a graph G is a function g from the vertex set V (G) to the family of all subsets of {1, 2} such that for each vertex v with g(v) =∅ we have ∪u∈N(v) g(u) = {1, 2}.
Poureidi Abolfazl, Rad Nader Jafari
doaj +3 more sources
Independent [1,2]-number versus independent domination number [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017 A [1; 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid Sahar A. +2 more
doaj +6 more sources
Graphs with equal domination and independent domination numbers [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Let γ(G) and i(G) denote the domination number and independent domination number of a graph G. In this article, we establish a sufficient condition for a graph G to satisfy which yields some of the well known classical theorems as corollaries.
Purnima Gupta, Rajesh Singh, S. Arumugam
doaj +2 more sources
On the outer-independent double Italian domination number
Electronic Journal of Graph Theory and Applications, 2022 An outer-independent Italian dominating function (OIIDF) on a graph G is a function f : V(G)→{0, 1, 2} such that every vertex v ∈ V(G) with f(v)=0 has at least two neighbors assigned 1 under f or one neighbor w with f(w)=2, and the set {u ∈ V(G)|f(u)=0}
Noor A'lawiah Abd Aziz +3 more
doaj +3 more sources
On the ratio of the domination number and the independent domination number in graphs
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michitaka Furuya, Kenta Ozeki
exaly +2 more sources
A note on the independent domination number in graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nader Jafari Rad, Lutz Volkmann
exaly +4 more sources
On the Independent Domination Number of Regular Graphs
Annals of Combinatorics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Henning +2 more
exaly +3 more sources
Independent double Roman domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a graph G = (V,E), a double Roman dominating function has the property that for every vertex with f(v) = 0, either there exists a vertex , with f(u) = 3, or at least two neighbors having f(x) = f(y) = 2, and every vertex with value 1 under f has at ...
H. R. Maimani +3 more
doaj +2 more sources
The Domination Parameters on a kind of the regular honeycomb structure [PDF]
Computer Science Journal of Moldova, 2022 The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One
Fateme Movahedi +2 more
doaj +1 more source