Results 61 to 70 of about 11,572,072 (152)
THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES [PDF]
Communications of the Korean Mathematical Society, 2003 Summary: We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
openaire +2 more sources
Independent Domination Of Subcubic Graphs [PDF]
, 2016 Let G be a simple graph. The independent domination number i(G) is the minimum cardinality among all maximal independent sets of G. A graph is subcubic whenever the maximum degree is at most three.
Priddy, Bruce Allan
core
Independent transversal domination in graphs [PDF]
, 2012 A set S ⊆ V of vertices in a graph G = (V, E) is called a dominating set if every vertex in V-S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set.
Hamid, Ismail
core +1 more source
Total and independent rainbow domination [PDF]
, 2022 V magistrskem delu predstavimo novi različici mavrične dominacije, celotno in neodvisno mavrično dominacijo. Podobno kot pri mavrični dominaciji sta tudi ti dve inačici povezani s posplošenimi prizmami $Gsquare K_k$.
Petek, Anja
core
On the Total Outer k-Independent Domination Number of Graphs
, 2020 A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph ...
Juan Carlos Hernández-Gómez +3 more
core +1 more source
Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
, 2019 A Roman {2}-dominating function (R{2}DF) on a graph G =(V, E) is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to either at least one vertex v with f(v) = 2 or two vertices v1, v2 with f(v1) = f ...
Zepeng Li +3 more
core +1 more source
Independent domination in graphs [PDF]
, 2018 V magistrskem delu obravnavamo različne tipe dominacij in sicer dominantno število, neodvisnostno število, neodvisno dominantno število in zgornje dominantno število.
Črešnjevec, Nina
core
Independent domination number in Cayley digraphs of rectangular groups
, 2018 Let [Formula: see text] denote the Cayley digraph of the rectangular group [Formula: see text] with respect to the connection set [Formula: see text] in which the rectangular group [Formula: see text] is isomorphic to the direct product of a group, a ...
Nuttawoot Nupo, Sayan Panma
core +1 more source
Bounds for the ratio between the domination number and the independent domination number
In this article we present new and improved results for the ratio between the independent domination number and the domination number in graphs with bounded degree. We present a general formula, that, for a fixed maximum degree, allows to compute an upper bound for this ratio as a function of an upper bound $β|V|$ for the independent domination number.
Brinkmann, Gunnar +1 more
openaire +2 more sources
Independent Domination in Complementary Prisms
, 2013 The complementary prism of a graph G is the graph formed from a disjoint union of G and its complement ̄G by adding the edges of a perfect matching between the corresponding vertices of G and G.
Haynes, Teresa W. +2 more
core +1 more source