On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs

DOI10.1016/S0012-365X(02)00836-1zbMath1030.05092MaRDI QIDQ1406558

Dieter Rautenbach, Lutz Volkmann

Publication date: 4 September 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

distance domination numberdistance independence numberdomination perfect graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs ⋮ Distance irredundance and connected domination numbers of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Upper domination and upper irredundance perfect graphs
• A characterization of \(\Gamma\alpha(k)\)-perfect graphs
• Perfect graphs of strong domination and independent strong domination
• Irredundance perfect graphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Stability, domination and irredundance in a graph
• Irredundance perfect andP6-free graphs
• The ratio of the irredundance number and the domination number for block-cactus graphs
• k-Bounded classes of dominant-independent perfect graphs
• An induced subgraph characterization of domination perfect graphs
• \(i\gamma(1)\)-perfect graphs

This page was built for publication: On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs