Premium
Vertices contained in every minimum dominating set of a tree
Author(s) -
Mynhardt C. M.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199907)31:3<163::aid-jgt2>3.0.co;2-t
Subject(s) - combinatorics , mathematics , dominating set , vertex (graph theory) , graph , discrete mathematics
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. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 163‐177, 1999