Graphs with Large Disjunctive Total Domination Number

zbMath1310.05159arXiv1409.1681MaRDI QIDQ5249240

Viroshan Naicker, Michael A. Henning

Publication date: 30 April 2015

Full work available at URL: https://arxiv.org/abs/1409.1681

zbMATH Keywords

disjunctive total dominating settotal dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

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 ⋮ Bounds on the disjunctive total domination number of a tree ⋮ Algorithmic aspects of \(b\)-disjunctive domination in graphs ⋮ b-Disjunctive Total Domination in Graphs: Algorithm and Hardness Results ⋮ On disjunctive domination in graphs ⋮ A constructive characterization of trees with equal total domination and disjunctive domination numbers

This page was built for publication: Graphs with Large Disjunctive Total Domination Number