Vertices contained in all or in no minimum disjunctive dominating set of a tree

MaRDI QIDQ4604347zbMATHFDO

Authors Michael A. Henning, Sinclair A. Marcon

Publication date 23 February 2018

zbMATH Keywords

treesdisjunctive domination

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Vertices belonging to all or to no minimum double dominating sets in trees
• Vertices contained in every minimum dominating set of a tree
• scientific article; zbMATH DE number 6470870 (Why is no real title available?)
• Vertices contained in all or in no minimum paired-dominating set of a tree
• Disjunctive domination in graphs with minimum degree at least two
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
• Bounds on the disjunctive domination number of a tree

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)