Vertices contained in all minimum paired-dominating sets of a tree

DOI10.1007/S10587-007-0069-1MaRDI QIDQ3617962zbMATH OpenOpenAlexFDO

Authors Xuegang Chen

Publication date 31 March 2009

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/31138, http://hdl.handle.net/10338.dmlcz/128180

zbMATH Keywords

domination numberpaired-dominating setpaired-domination numbertree

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

• Vertices contained in all or in no minimum paired-dominating set of a tree
• scientific article; zbMATH DE number 2192132
• Paired-domination of trees
• Trees with equal domination and paired-domination numbers.
• Graphs with unique minimum paired-dominating set.

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Paired-domination in graphs
• Strong equality of domination parameters in trees
• Vertices Belonging to All or to No Maximum Stable Sets of a Graph
• Vertices contained in all or in no minimum total dominating set of a tree
• Vertices contained in every minimum dominating set of a tree

Cited in

(4)

• Graphs with unique minimum paired-dominating set.
• Vertices contained in every minimum dominating set of a tree
• A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences
• Vertices contained in all or in no minimum paired-dominating set of a tree

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

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