The disjunctive domination number of a graph

DOI10.2989/16073606.2014.894688zbMath1404.05150OpenAlexW2089228910MaRDI QIDQ2968643

Wayne Goddard, Charles A. McPillan, Michael A. Henning

Publication date: 20 March 2017

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2014.894688

zbMATH Keywords

algorithmsgraphdistancedomination

Mathematics Subject Classification ID

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

Related Items (17)

Disjunctive total domination in graphs ⋮ The Disjunctive Bondage Number and the Disjunctive Total Bondage Number of Graphs ⋮ Algorithmic Aspects of Disjunctive Domination in Graphs ⋮ Disjunctive domination in graphs with minimum degree at least two ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Algorithmic Aspects of Disjunctive Total Domination in Graphs ⋮ Analysis of Vulnerability of Some Transformation Networks ⋮ Disjunctive total domination in permutation graphs ⋮ Bounds on the disjunctive total domination number of a tree ⋮ Relating domination, exponential domination, and porous exponential domination ⋮ Algorithmic aspects of \(b\)-disjunctive domination in graphs ⋮ b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results ⋮ On disjunctive domination in graphs ⋮ Domination versus disjunctive domination in graphs ⋮ A constructive characterization of trees with equal total domination and disjunctive domination numbers ⋮ Total domination in digraphs ⋮ Domination versus disjunctive domination in trees

This page was built for publication: The disjunctive domination number of a graph