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
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
More on limited packings in graphs, A survey of selected recent results on total domination in graphs, Essential upper bounds on the total domination number, Total domination and the Caccetta-Häggkvist conjecture, Total domination in 2-connected graphs and in graphs with no induced 6-cycles