Domination versus disjunctive domination in graphs

DOI10.2989/16073606.2015.1068237zbMath1422.05081OpenAlexW2327043959MaRDI QIDQ5233919

Michael A. Henning, Sinclair A. Marcon

Publication date: 9 September 2019

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

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

zbMATH Keywords

dominationdisjunctive domination

Mathematics Subject Classification ID

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

Related Items (3)

Disjunctive domination in graphs with minimum degree at least two ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Relating domination, exponential domination, and porous exponential domination

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On exponential domination of \(C_m\times C_n\)
• Domination with exponential decay
• Domination versus disjunctive domination in trees
• A new bound on the domination number of connected cubic graphs
• The disjunctive domination number of a graph
• Paths, Stars and the Number Three
• Total Domination in Graphs

This page was built for publication: Domination versus disjunctive domination in graphs