Vertices contained in every minimum dominating set of a tree

DOI10.1002/(SICI)1097-0118(199907)31:3%3C163::AID-JGT2%3E3.0.CO;2-TMaRDI QIDQ4256089zbMATH OpenOpenAlexFDO

Authors Christina M. Mynhardt

Publication date 16 February 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199907)31:3%3C163::aid-jgt2%3E3.0.co;2-t

zbMATH Keywords

dominating settree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Vertices contained in all or in no minimum total dominating set of a tree
• Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
• Vertices contained in all or in no minimum disjunctive dominating set of a tree
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• Vertices contained in all minimum paired-dominating sets of a tree
• Vertices belonging to all or to no minimum vertex-edge dominating sets in trees
• Vertices belonging to all or to no minimum locating dominating sets of trees
• scientific article; zbMATH DE number 6470870
• Vertices belonging to all or to no minimum double dominating sets in trees

Cited in

(33)

• Changing and unchanging domination: A classification
• A note on connected bipartite graphs having independent domination number half their order.
• Vertices contained in all or in no minimum total dominating set of a tree
• Vertices in all minimum paired-dominating sets of block graphs
• Unique minimum semipaired dominating sets in trees
• Trees with minimum number of infima closed sets
• 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
• On the vertices belonging to all, some, none minimum dominating set
• On accurate domination in graphs
• Construction of trees and graphs with equal domination parameters
• The topology of the independence complex
• Vertices contained in all or in no minimum \(k\)-dominating sets of a tree
• Changing and unchanging of the domination number of a graph
• Vertices belonging to all or to no minimum double dominating sets in trees
• Construction for trees without domination critical vertices
• Vizing's conjecture: a survey and recent results
• On the number of minimal dominating sets including the set of leaves in trees
• Vertices contained in all minimum paired-dominating sets of a tree
• Vertices belonging to all or to no minimum locating dominating sets of trees
• Conical and spherical graphs
• scientific article; zbMATH DE number 1507962 (Why is no real title available?)
• Vertices contained in all or in no minimum disjunctive dominating set of a tree
• Construction for trees without vertices contained in all minimum dominating sets.
• Connected domination value in graphs
• Edges contained in all or in no minimum edge dominating set of a tree
• scientific article; zbMATH DE number 6470870 (Why is no real title available?)
• On construction for trees making the equality hold in Vizing's conjecture
• Zero and total forcing dense graphs
• Roman domination value in graphs
• Vertices contained in all or in no minimum semitotal dominating set of a tree
• Cores of simplicial complexes
• Vertices contained in all or in no minimum paired-dominating set of a tree

This page was built for publication: Vertices contained in every minimum dominating set of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256089)