Independence and Domination in $3$-Connected Cubic Graphs

Abstract

An infinite class of graphs is constructed to demonstrate that the difference between the independent domination number and the domination number of $3$-connected cubic graphs may be arbitrarily large.