A new upper bound on the total domination number of a graph
From MaRDI portal
Publication:1010625
zbMath1158.05046MaRDI QIDQ1010625
Michael A. Henning, Anders Yeo
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129703
Related Items (8)
A new lower bound on the total domination number of a graph ⋮ Relating the total domination number and the annihilation number for quasi-trees and some composite graphs ⋮ On the forcing domination and the forcing total domination numbers of a graph ⋮ Total domination and the Caccetta-Häggkvist conjecture ⋮ Essential upper bounds on the total domination number ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ A survey of selected recent results on total domination in graphs ⋮ More on limited packings in graphs
This page was built for publication: A new upper bound on the total domination number of a graph
