Skip to main content

Research Repository

Advanced Search

Disproof of a Conjecture in the Domination Theory

Zverovich, I. E.; Zverovich, V. E.; Zverovich, Igor; Zverovich, Vadim

Authors

I. E. Zverovich

V. E. Zverovich

Igor Zverovich



Abstract

In [1] C. Barefoot, F. Harary and K. Jones conjectured that for cubic graphs with connectivity three the difference between the domination and independent domination numbers is at most one. We disprove this conjecture and give an exhaustive answer to the question: “What is the difference between the domination and independent domination numbers for cubic graphs with given connectivity?” © 1994, Springer-Verlag. All rights reserved.

Citation

Zverovich, V. E., Zverovich, I. E., Zverovich, I., & Zverovich, V. (1994). Disproof of a Conjecture in the Domination Theory. Graphs and Combinatorics, 10(2), 389-396. https://doi.org/10.1007/BF02986690

Journal Article Type Article
Publication Date Jan 1, 1994
Journal Graphs and Combinatorics
Print ISSN 0911-0119
Electronic ISSN 1435-5914
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 10
Issue 2
Pages 389-396
DOI https://doi.org/10.1007/BF02986690
Keywords domination theory
Public URL https://uwe-repository.worktribe.com/output/1108216
Publisher URL http://dx.doi.org/10.1007/BF02986690