Vertices contained in all or in no minimum paired-dominating set of a tree

DOI10.1007/S10878-005-4107-3zbMATH Open1122.05071OpenAlexW2059672600MaRDI QIDQ995930

Michael A. Henning, Michael D. Plummer

Publication date: 10 September 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-4107-3

zbMATH Keywords

treepaired-domination number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination in claw-free cubic graphs
• Paired-domination of trees
• Vertices contained in all or in no minimum total dominating set of a tree
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
• Paired-domination
• Vertices contained in every minimum dominating set of a tree
• Paired-domination in graphs

Related Items (20)

Paired-domination subdivision numbers of graphs ⋮ Paired-domination in claw-free graphs ⋮ Graphs with large paired-domination number ⋮ Graphs with disjoint dominating and paired-dominating sets ⋮ Unnamed Item ⋮ Vertices in all minimum paired-dominating sets of block graphs ⋮ Vertices contained in all or in no minimum semitotal dominating set of a tree ⋮ Graphs with maximum size and given paired-domination number ⋮ Paired-domination in claw-free graphs with minimum degree at least three ⋮ Paired-domination in generalized claw-free graphs ⋮ Locating and paired-dominating sets in graphs ⋮ Which trees have a differentiating-paired dominating set? ⋮ An upper bound on the paired-domination number in terms of the number of edges in the graph ⋮ A characterization of graphs with disjoint dominating and paired-dominating sets ⋮ Upper paired-domination in claw-free graphs ⋮ Edges contained in all or in no minimum edge dominating set of a tree ⋮ Vertices contained in every minimum dominating set of a tree ⋮ A polynomial-time algorithm for the paired-domination problem on permutation graphs ⋮ The diameter of paired-domination vertex critical graphs ⋮ Paired Domination in Graphs

This page was built for publication: Vertices contained in all or in no minimum paired-dominating set of a tree