I. E. Zverovich
Disproof of a Conjecture in the Domination Theory
Zverovich, I. E.; Zverovich, V. E.; Zverovich, Igor; Zverovich, Vadim
Authors
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 |
You might also like
Methods of Graph Decompositions
(2022)
Book
Modern Applications of Graph Theory
(2021)
Book
The likelihood of Braess' paradox in traffic networks
(2018)
Book Chapter
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search