Domination, independent domination number and 2-independence number in trees [PDF]
Discussiones Mathematicae Graph Theory, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dehgardi Nasrin +4 more
core +4 more sources
Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \{2\} -domination number [PDF]
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi, Nader Jafari Rad
openaire +3 more sources
Independent [1,2]-number versus independent domination number [PDF]
Analele Universitatii "Ovidius" Constanta - Seria Matematica, 2017 Abstract 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 graph. In this paper we provide local conditions, depending on the degree of
Aleid, Sahar A. +2 more
openaire +6 more sources
The independent domination number of a random graph [PDF]
Discussiones Mathematicae Graph Theory, 2011 We prove a two-point concentration for the independent domination number of the random graph Gn,p provided p 2 ln(n) 64ln((lnn)=p). occurs asymptotically almost surely (a.a.s.) if P(Gn;p has property A) ! 1 as n ! 1 . See Bollobas (2) for notation and terminology. Weber (7) showed if p = 1=2 then a.a.s. (Gn;p) is either blog2 n − log2(log2 nlnn)c + 1
Lane H. Clark, Darin Johnson
openaire +2 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
A note on the independent domination number of subset graph [PDF]
Czechoslovak Mathematical Journal, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xuegang +3 more
openaire +3 more sources
Extremal connected graphs for independent domination number
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +2 more
core +5 more sources
On independent domination number of regular graphs
Discrete Mathematics, 1999 A subset \(S\) of the vertex set of a graph \(G\) is called independent, if no two of its vertices are adjacent in \(G\). An independent set in \(G\) is maximal, if it is not a proper subset of another independent set of \(G\). The minimum number of vertices of a maximal independent set is the independent domination number \(i(G)\) of \(G\).
Peter Che Bor Lam +2 more
openaire +4 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. Further, we also construct several families of graphs G satisfying γ(G) = i(G) using the sufficient condition.
Purnima Gupta +2 more
openaire +2 more sources