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.
Citation
Volkmann, L., & Zverovich, V. (2002). Proof of a conjecture on irredundance perfect graphs. Journal of Graph Theory, 41(4), 292-306. https://doi.org/10.1002/jgt.10068
Journal Article Type | Article |
---|---|
Publication Date | Dec 1, 2002 |
Journal | Journal of Graph Theory |
Print ISSN | 0364-9024 |
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
Two-graph building interior representation for emergency response applications
(2016)
Presentation / Conference
CUBER: Critical Urban Buildings Emergency Response
(2016)
Presentation / Conference
Emergency response in complex buildings: Automated selection of safest and balanced routes
(2016)
Journal Article