Upper domination and upper irredundance perfect graphs
From MaRDI portal
Publication:1584381
DOI10.1016/S0012-365X(98)00036-3zbMath0956.05077MaRDI QIDQ1584381
Vadim E. Zverovich, Gregory Gutin
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (7)
On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs ⋮ Independence and upper irredundance in claw-free graphs ⋮ \(\alpha \)-domination perfect trees ⋮ A note on an induced subgraph characterization of domination perfect graphs ⋮ Edge Weighting Functions on Dominating Sets ⋮ Edge weighting functions on semitotal dominating sets ⋮ Irredundance
Cites Work
- Unnamed Item
- Preperfect graphs
- Irredundancy in circular arc graphs
- A note on graphs which have upper irredundance equal to independence
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
- Irredundance perfect graphs
- An induced subgraph characterization of domination perfect graphs
This page was built for publication: Upper domination and upper irredundance perfect graphs
