A constructive characterization of trees with equal total domination and disjunctive domination numbers

DOI10.2989/16073606.2015.1096860zbMath1419.05169OpenAlexW2462324041MaRDI QIDQ5233942

Sinclair A. Marcon, Michael A. Henning

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.1096860

zbMATH Keywords

treesdominationdisjunctive domination

Mathematics Subject Classification ID

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

Related Items (6)

Construction for trees without domination critical vertices ⋮ Disjunctive domination in graphs with minimum degree at least two ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Independent transversal total domination versus total domination in trees ⋮ Algorithmic aspects of \(b\)-disjunctive domination in graphs ⋮ Graphs with equal domination and covering numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Disjunctive total domination in graphs
• On exponential domination of \(C_m\times C_n\)
• A survey of selected recent results on total domination in graphs
• Domination with exponential decay
• Relations between packing and covering numbers of a tree
• Domination versus disjunctive domination in trees
• Construction of trees and graphs with equal domination parameters
• The disjunctive domination number of a graph
• Graphs with large total domination number
• Total Domination in Graphs
• Graphs with Large Disjunctive Total Domination Number

This page was built for publication: A constructive characterization of trees with equal total domination and disjunctive domination numbers