\(\alpha \)-domination perfect trees

DOI10.1016/j.disc.2007.06.043zbMath1169.05031OpenAlexW2166351041MaRDI QIDQ932588

F. Dahme, Dieter Rautenbach, Lutz Volkmann

Publication date: 11 July 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.043

zbMATH Keywords

independencedomination\(\alpha \)-dominationforbidden induced subgraphdomination perfect graph

Mathematics Subject Classification ID

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

Related Items (4)

Edge-removal and edge-addition in \(\alpha \)-domination ⋮ Upper bounds for \(\alpha \)-domination parameters ⋮ On \(\alpha \)-domination in graphs ⋮ Alliances in graphs of bounded clique-width

Cites Work

• Unnamed Item
• On graphs with equal domination and independent domination numbers
• Upper domination and upper irredundance perfect graphs
• A characterization of \(\Gamma\alpha(k)\)-perfect graphs
• Perfect graphs of strong domination and independent strong domination
• \(\alpha\)-domination
• A semi-induced subgraph characterization of upper domination perfect 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: \(\alpha \)-domination perfect trees