Domination versus disjunctive domination in trees
From MaRDI portal
Publication:2341765
DOI10.1016/j.dam.2014.10.036zbMath1311.05149MaRDI QIDQ2341765
Michael A. Henning, Sinclair A. Marcon
Publication date: 28 April 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.036
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Domination versus disjunctive domination in graphs, A constructive characterization of trees with equal total domination and disjunctive domination numbers, Disjunctive domination in graphs with minimum degree at least two, Algorithmic aspects of paired disjunctive domination in graphs, Algorithmic aspects of \(b\)-disjunctive domination in graphs, Relating domination, exponential domination, and porous exponential domination, Domination versus disjunctive domination in trees, b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results, Algorithmic Aspects of Disjunctive Total Domination in Graphs, Algorithmic Aspects of Disjunctive Domination in Graphs, The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs
Cites Work