Bounds on the disjunctive total domination number of a tree
From MaRDI portal
Publication:907839
DOI10.7151/DMGT.1854zbMath1329.05233OpenAlexW2341369637MaRDI QIDQ907839
Viroshan Naicker, Michael A. Henning
Publication date: 26 January 2016
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1854
Related Items (7)
Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ Complexity and bounds for disjunctive total bondage ⋮ Algorithmic aspects of paired disjunctive domination in graphs ⋮ Algorithmic Aspects of Disjunctive Total Domination in Graphs ⋮ Analysis of Vulnerability of Some Transformation Networks ⋮ Algorithmic aspects of \(b\)-disjunctive domination in graphs ⋮ On disjunctive domination in graphs
Cites Work
- Disjunctive total domination in graphs
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Total and paired-domination numbers of a tree
- The disjunctive domination number of a graph
- Total domination in graphs
- Some remarks on domination
- Graphs with large total domination number
- Total Domination in Graphs
- Graphs with Large Disjunctive Total Domination Number
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds on the disjunctive total domination number of a tree
