Results 11 to 20 of about 8,253 (248)
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abolfazl Poureidi, Nader Jafari Rad
openaire +3 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 +2 more sources
The independent domination number of a random graph
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
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
An Upper Bound for the Independent Domination Number
Journal of Combinatorial Theory, Series B, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liang Sun, Jianfang Wang
openaire +2 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 +3 more sources
On Equality and Strong Equality of Domination Number and Independent Domination Number in Graphs
Mapana - Journal of Sciences, 2015 In this paper we explore graphs having same domination number and independent domination number . Such graphs are denoted as ( , )-graphs. Several families of ( , )-graphs have been constructed. The realization problem for graphs with = = a for any given positive integer a has been solved. Furthermore, properties of graphs in which every -set is a
Pious Femlin, Joseph Mayamma
openaire +3 more sources
Weak and Strong Reinforcement Number For a Graph [PDF]
, 2010 Introducing the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number, and giving some boundary of this new parameter and ...
DOGAN, Derya +2 more
core +1 more source
Domination and Independent Domination in Hexagonal Systems
, 2021 A vertex subset D of G is a dominating set if every vertex in V(G)\D is adjacent to a vertex in D. A dominating set D is independent if G[D], the subgraph of G induced by D, contains no edge.
Norah Almalki, Pawaton Kaemawichanurat
core +1 more source
On the Outer Independent Double Roman Domination Number [PDF]
Bulletin of the Iranian Mathematical Society, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doost Ali Mojdeh +3 more
openaire +1 more source