Total domination excellent trees

Authors:
Michael A. Henning
Affiliations:
School of Mathematics, Statistics and Information Technology, University of Natal, Private Bay X01, Pietermaritzburg 3209, South Africa
Venue:
Discrete Mathematics
Year:
2003

Citing 3
Cited 1

A characterization of i-excellent trees

Discrete Mathematics
Total domination in graphs with minimum degree three

Journal of Graph Theory
Graphs with large total domination number

Journal of Graph Theory

β0-excellent graphs

WSEAS Transactions on Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent to some vertex in S (other than itself). The graph G is called total domination excellent if every vertex belongs to some total dominating set of G of minimum cardinality. We provide a constructive characterization of total domination excellent trees.