Vertices contained in every minimum dominating set of a tree
From MaRDI portal
Publication:4256089
DOI<163::AID-JGT2>3.0.CO;2-T 10.1002/(SICI)1097-0118(199907)31:3<163::AID-JGT2>3.0.CO;2-TzbMath0931.05063OpenAlexW4247060915MaRDI QIDQ4256089
Publication date: 16 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199907)31:3<163::aid-jgt2>3.0.co;2-t
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (21)
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 ⋮ Construction for trees without domination critical vertices ⋮ Vertices in all minimum paired-dominating sets of block graphs ⋮ On accurate domination in graphs ⋮ On construction for trees making the equality hold in Vizing's conjecture ⋮ Vertices contained in all or in no minimum semitotal dominating set of a tree ⋮ Construction of trees and graphs with equal domination parameters ⋮ Changing and unchanging domination: A classification ⋮ Conical and spherical graphs ⋮ Unnamed Item ⋮ Cores of simplicial complexes ⋮ A note on connected bipartite graphs having independent domination number half their order. ⋮ The topology of the independence complex ⋮ 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 ⋮ Connected domination value in graphs ⋮ Vertices contained in all minimum paired-dominating sets of a tree ⋮ Changing and unchanging of the domination number of a graph ⋮ Vizing's conjecture: a survey and recent results ⋮ Unique minimum semipaired dominating sets in trees
This page was built for publication: Vertices contained in every minimum dominating set of a tree
