Lower bound on the paired domination number of a tree

MaRDI QIDQ5487928zbMATH OpenFDO

Authors Joanna Raczek

Publication date 13 September 2006

zbMATH Keywords

dominating setperfect matching

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Paired domination in trees
• Trees with equal domination and paired-domination numbers.
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Paired-domination of trees
• Trees with large paired-domination number

Cited in

(9)

• A polynomial-time algorithm for the paired-domination problem on permutation graphs
• Paired-domination of trees
• Paired domination in trees
• Upper paired-domination in claw-free graphs
• Paired domination in graphs
• The paired-domination and the upper paired-domination numbers of graphs
• scientific article; zbMATH DE number 5174847 (Why is no real title available?)
• Uniformly pair-bonded trees.
• Some comments on the Slater number

This page was built for publication: Lower bound on the paired domination number of a tree

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