Domination versus disjunctive domination in trees

DOI10.1016/j.dam.2014.10.036zbMath1311.05149OpenAlexW2053022865MaRDI 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

zbMATH Keywords

dominationdisjunctive domination

Mathematics Subject Classification ID

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

Related Items (11)

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 ⋮ 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 ⋮ Domination versus disjunctive domination in graphs ⋮ A constructive characterization of trees with equal total domination and disjunctive domination numbers ⋮ Domination versus disjunctive domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• On exponential domination of \(C_m\times C_n\)
• Domination with exponential decay
• Domination versus disjunctive domination in trees
• Construction of trees and graphs with equal domination parameters
• The disjunctive domination number of a graph

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