2 research outputs found
On independent domination of regular graphs
Given a graph , a dominating set of is a set of vertices such that
each vertex not in has a neighbor in . The domination number of ,
denoted , is the minimum size of a dominating set of . The
independent domination number of , denoted , is the minimum size of a
dominating set of that is also independent. Note that every graph has an
independent dominating set, as a maximal independent set is equivalent to an
independent dominating set.
Let be a connected -regular graph that is not where . Generalizing a result by Lam, Shiu, and Sun, we prove that , which is tight for . This answers a question by
Goddard et al. in the affirmative. We also show that , strengthening upon a result of Knor,
\v{S}krekovski, and Tepeh. In addition, we prove that a graph with maximum
degree at most satisfies , which is also
tight.Comment: 15 pages, 5 figure
Independent Domination in Subcubic Graphs
A set of vertices in a graph is a dominating set if every vertex not
in is adjacent to a vertex in . If, in addition, is an independent
set, then is an independent dominating set. The independent domination
number of is the minimum cardinality of an independent dominating
set in . In 2013 Goddard and Henning [Discrete Math 313 (2013), 839--854]
conjectured that if is a connected cubic graph of order , then , except if is the complete bipartite graph or the
-prism . Further they construct two infinite families of
connected cubic graphs with independent domination three-eighths their order.
They remark that perhaps it is even true that for these two families
are only families for which equality holds. In this paper, we provide a new
family of connected cubic graphs of order such that . We also show that if is a subcubic graph of order with
no isolated vertex, then , and we characterize the
graphs achieving equality in this bound.Comment: Submitted to Discrete Applied Mathematics Journal, 08 Jan 202