Vertices contained in every minimum dominating set of a tree

✍ Scribed by Mynhardt, C. M.

• Publisher: John Wiley and Sons
• Year: 1999
• Tongue: English
• Weight: 321 KB
• Volume: 31
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199907)31:3<163::aid-jgt2>3.0.co;2-t

✦ Synopsis

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating sets of trees.