Vertices contained in all or in no minimum disjunctive dominating set of a tree
From MaRDI portal
Publication:4604347
zbMATH Open1384.05123MaRDI QIDQ4604347FDOQ4604347
Authors: Michael A. Henning, Sinclair A. Marcon 
Publication date: 23 February 2018
Recommendations
- Bounds on the disjunctive domination number of a tree
- On disjunctive domination in graphs
- Vertices contained in every minimum dominating set of a tree
- Disjunctive domination in graphs with minimum degree at least two
- A constructive characterization of trees with equal total domination and disjunctive domination numbers
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (6)
- Vertices belonging to all or to no minimum double dominating sets in trees
- Title not available (Why is that?)
- Vertices contained in every minimum dominating set of a tree
- Vertices contained in all or in no minimum paired-dominating set of a tree
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
- Disjunctive domination in graphs with minimum degree at least two
This page was built for publication: Vertices contained in all or in no minimum disjunctive dominating set of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4604347)
