Domination versus independent domination in cubic graphs

DOI10.1016/j.disc.2012.01.003zbMath1277.05129OpenAlexW2031662678MaRDI QIDQ385388

Justin Southey, Michael A. Henning

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.01.003

zbMATH Keywords

cubic graphsdominationratioindependent domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

The independent domination numbers of strong product of two cycles ⋮ Cubic graphs with large ratio of independent domination number to domination number ⋮ Independent domination in subcubic graphs of girth at least six ⋮ Domination versus independent domination in graphs of small regularity ⋮ On independent domination of regular graphs ⋮ The extremal average distance of cubic graphs ⋮ Domination versus independent domination in regular graphs ⋮ Independent domination in bipartite cubic graphs ⋮ On the ratio of the domination number and the independent domination number in graphs ⋮ On independent domination in planar cubic graphs ⋮ Independent domination in subcubic graphs ⋮ An improved upper bound on the independent domination number in cubic graphs of girth at least six

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent dominating sets in triangle-free graphs
• The independent domination number of a cubic 3-connected graph can be much larger than its domination number
• What is the difference between the domination and independent domination numbers of a cubic graph?
• On independent domination number of regular graphs
• An upper bound for the independent domination number
• Disproof of a conjecture in the domination theory
• Independent domination in regular graphs
• On the independent domination number of regular graphs
• Triangle-free graphs with large independent domination number
• A counterexample to conjecture of Barefoot, Harary, and Jones
• Upper bounds for independent domination in regular graphs
• Independent dominating sets and hamiltonian cycles
• Towards a theory of domination in graphs