Vertices contained in all or in no minimum total dominating set of a tree
From MaRDI portal
Publication:1861240
DOI10.1016/S0012-365X(02)00447-8zbMath1013.05054MaRDI QIDQ1861240
Michael A. Henning, E. J. Cockayne, Christina M. Mynhardt
Publication date: 16 March 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree ⋮ On vertices contained in all or in no metric basis ⋮ Vertices in all minimum paired-dominating sets of block graphs ⋮ Total domination dot-critical graphs ⋮ Vertices contained in all or in no minimum semitotal dominating set of a tree ⋮ Edges contained in all or in no minimum edge dominating set of a tree ⋮ Vertices contained in all or in no minimum paired-dominating set of a tree ⋮ A survey of selected recent results on total domination in graphs ⋮ Connected domination value in graphs ⋮ Vertices contained in all minimum paired-dominating sets of a tree ⋮ A classification of cactus graphs according to their total domination number
This page was built for publication: Vertices contained in all or in no minimum total dominating set of a tree
