The independent domination number of a cubic 3-connected graph can be much larger than its domination number

DOI10.1007/BF02988312zbMath0783.05062OpenAlexW2020103766MaRDI QIDQ687719

Alexandr V. Kostochka

Publication date: 28 October 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988312

zbMATH Keywords

dominating setindependent domination numberindependent dominating setdomination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (11)

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 cubic graphs ⋮ On the independent domination number of regular graphs ⋮ Domination versus independent domination in regular graphs ⋮ A structural approach for independent domination of regular graphs ⋮ Independent domination in bipartite cubic 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

• On domination and independent domination numbers of a graph
• What is the difference between the domination and independent domination numbers of a cubic graph?

This page was built for publication: The independent domination number of a cubic 3-connected graph can be much larger than its domination number