Paired-domination in \(P_{5}\)-free graphs

DOI10.1007/s00373-008-0792-xzbMath1193.05123OpenAlexW2090369575MaRDI QIDQ1014817

Paul Dorbec, Sylvain Gravier

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0792-x

zbMATH Keywords

boundspaired-dominationsubdivided star\(P_{5}\)-free

Mathematics Subject Classification ID

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

Related Items (7)

Paired-domination in subdivided star-free graphs ⋮ Graphs with disjoint dominating and paired-dominating sets ⋮ Total domination versus paired-domination in regular graphs ⋮ Graphs with maximum size and given paired-domination number ⋮ Paired versus double domination in \(K_{1,r}\)-free graphs ⋮ An upper bound on the paired-domination number in terms of the number of edges in the graph ⋮ Paired Domination in Graphs

Cites Work

• Paired-domination in claw-free cubic graphs
• Paired-domination in generalized claw-free graphs
• On a property of the class of n-colorable graphs
• Paired-domination in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paired-domination in \(P_{5}\)-free graphs