Lutz Volkmann
A disproof of Henning's 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 paper, we disprove the known conjecture of Henning (Chartrand and Lesniak, Graphs & Digraphs, 3rd Edition, Chapman & Hall, London, 1996, p. 321; Henning, Discrete Math. 142 (1995) 107) that a graph G is irredundance perfect if and only if ir(H) = γ(H) for every induced subgraph H of G with ir(H) ≤ 4. We also give a summary of known results on irredundance perfect graphs. Moreover, the irredundant set problem and the dominating set problem are shown to be NP-complete on some classes of graphs. A number of problems and conjectures are proposed. © 2002 Elsevier Science B.V. All rights reserved.
Citation
Volkmann, L., & Zverovich, V. (2002). A disproof of Henning's conjecture on irredundance perfect graphs. Discrete Mathematics, 254(1-3), 539-554. https://doi.org/10.1016/S0012-365X%2801%2900300-4
Journal Article Type | Article |
---|---|
Publication Date | Jun 10, 2002 |
Journal | Discrete Mathematics |
Print ISSN | 0012-365X |
Publisher | Elsevier |
Peer Reviewed | Not Peer Reviewed |
Volume | 254 |
Issue | 1-3 |
Pages | 539-554 |
DOI | https://doi.org/10.1016/S0012-365X%2801%2900300-4 |
Keywords | mathematics, maths, graphs, Henning, irredundance |
Public URL | https://uwe-repository.worktribe.com/output/1077756 |
Publisher URL | http://dx.doi.org/10.1016/S0012-365X(01)00300-4 |
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