×

zbMATH — the first resource for mathematics

Vertices belonging to all or to no minimum double dominating sets in trees. (English) Zbl 1076.05058
Summary: In a graph \(G= (V, E)\), a vertex dominates itself and all its neighbors. A double dominating set of \(G\) is a dominating set that dominates every vertex of \(G\) at least twice. We characterize vertices that are in all or in no minimum double dominating sets in trees.

MSC:
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
PDF BibTeX XML Cite