Vertices contained in every minimum dominating set of a tree
From MaRDI portal
Publication:4256089
DOI10.1002/(SICI)1097-0118(199907)31:3%3C163::AID-JGT2%3E3.0.CO;2-TzbMATH Open0931.05063OpenAlexW4247060915MaRDI QIDQ4256089FDOQ4256089
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
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
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (25)
- Connected domination value in graphs
- Vizing's conjecture: a survey and recent results
- Vertices belonging to all or to no minimum double dominating sets in trees
- Unique minimum semipaired dominating sets in trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cores of simplicial complexes
- Vertices contained in all or in no minimum paired-dominating set of a tree
- The topology of the independence complex
- On construction for trees making the equality hold in Vizing's conjecture
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets 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 semitotal dominating set of a tree
- Conical and spherical graphs
- A note on connected bipartite graphs having independent domination number half their order.
- Changing and unchanging of the domination number of a graph
- Vertices in all minimum paired-dominating sets of block graphs
- On vertices contained in all or in no metric basis
- Construction for trees without domination critical vertices
- Changing and unchanging domination: A classification
- Construction of trees and graphs with equal domination parameters
- Vertices contained in all or in no minimum total dominating set of a tree
- On accurate domination in graphs
- Vertices contained in all minimum paired-dominating sets of a tree
- Vertices belonging to all or to no minimum locating dominating sets of trees
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)
