Lower bound on the paired domination number of a tree

zbMATH Open1105.05054MaRDI QIDQ5487928FDOQ5487928

Authors: Joanna Raczek 

Publication date: 13 September 2006

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

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)

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
• The paired-domination and the upper paired-domination numbers of graphs
• Title not available (Why is that?)
• Uniformly pair-bonded trees.
• Paired Domination in Graphs
• 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)