Lutz Volkmann
Proof of a conjecture on irredundance perfect graphs
Volkmann, Lutz; Zverovich, Vadim
Abstract
Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs.
Journal Article Type | Article |
---|---|
Publication Date | Dec 1, 2002 |
Journal | Journal of Graph Theory |
Print ISSN | 0364-9024 |
Electronic ISSN | 1097-0118 |
Publisher | Wiley |
Peer Reviewed | Not Peer Reviewed |
Volume | 41 |
Issue | 4 |
Pages | 292-306 |
DOI | https://doi.org/10.1002/jgt.10068 |
Keywords | mathematics, irredundance, perfect, graphs, proof |
Public URL | https://uwe-repository.worktribe.com/output/1075616 |
Publisher URL | http://dx.doi.org/10.1002/jgt.10068 |
You might also like
On general frameworks and threshold functions for multiple domination
(2015)
Journal Article
Braess’ paradox in asymmetrical traffic networks
(2014)
Presentation / Conference Contribution
Bounds and algorithms for limited packings in graphs
(2014)
Presentation / Conference Contribution
Braess' paradox in a generalised traffic network
(2014)
Journal Article
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