Results 11 to 20 of about 8,369 (289)
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 +3 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
Extremal connected graphs for independent domination number [PDF]
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brigham, Robert C. +2 more
core +6 more sources
On independent domination number of regular graphs [PDF]
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
An Upper Bound for the Independent Domination Number [PDF]
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 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
On Equality and Strong Equality of Domination Number and Independent Domination Number in Graphs [PDF]
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
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
Independent Restrained k - Rainbow Dominating Function
Ratio Mathematica, 2022 Let G be a graph and let f be a function that assigns to each vertex a set of colors chosen from the set {1, 2…, k} that is f: V(G) P [1,2,…,k]. If for each vertex v V(G) such that f(v) = .we have then f is called the k – Rainbow Dominating Function (
M Esakki Dharani, A Nagarajan, K Palani
doaj +1 more source