Lower bounds on the p-domination number in terms of cycles and matching number

MaRDI QIDQ3635575zbMATH OpenFDO

Authors Adriana Hansberg, Lutz Volkmann

Publication date 6 July 2009

zbMATH Keywords

cactus graphdominationmatching number\(p\)-dominationmultiple domination2 domination number

Mathematics Subject Classification ID

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

Recommendations

• On graphs with equal domination and 2-domination numbers
• On the p-domination number of cactus graphs
• On 2-domination and independence domination numbers of graphs.
• Bounds of the 2-domination number of graphs
• scientific article; zbMATH DE number 5238170

Cited in

(8)

• \(k\)-domination and \(k\)-independence in graphs: A survey
• Bounds of the 2-domination number of graphs
• On the p-domination number of cactus graphs
• On graphs with equal domination and 2-domination numbers
• On 2-domination and independence domination numbers of graphs.
• Partial domination -- the isolation number of a graph
• Bounds on the \(k\)-domination number of a graph
• Multiple domination

This page was built for publication: Lower bounds on the \(p\)-domination number in terms of cycles and matching number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635575)