Abstract
Let α be the domination number and α′ be the independent domination number of a graph. An infinite class of 3-connected cubic graphs is given, for which α′ - α is unbounded.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barefoot, C., Harary, F., Jones, K.F. (1991): What is the difference between the domination and independent domination numbers of cubic graph? Graphs Comb.7, 205–208
Author information
Authors and Affiliations
Additional information
This work was done while the authors were visiting the Institut für Mathematik und Angewandte Geometrie at the Montanuniversität Leoben, Austria, partially supported by the Research Council of Slovenia and by the Bundesministerium für Wissenschaft und Forschung of Austria
Rights and permissions
About this article
Cite this article
Žerovnik, J., Oplerova, J. A counterexample to conjecture of Barefoot, Harary, and Jones. Graphs and Combinatorics 9, 205–207 (1993). https://doi.org/10.1007/BF02988308
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02988308