• Published 2005

A note on the total domination number of a tree

@inproceedings{Chellali2005ANO,
  title={A note on the total domination number of a tree},
  author={Mustapha Chellali and Teresa W. Haynes},
  year={2005}
}
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number t(G). We show that for a nontrivial tree T of order n and with ` leaves, t(T ) > (n+2 `)=2, and we characterize the trees attaining this lower bound. Keywords: total domination, trees. AMS subject classi…cation: 05C69 

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

On Total Domination in Graphs

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On total domination and support vertices of a tree

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Bounds on the disjunctive total domination number of a tree

  • Discussiones Mathematicae Graph Theory
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

LOWER BOUND ON THE DOMINATION NUMBER OF A TREE

Discussiones Mathematicae
  • 2004
VIEW 2 EXCERPTS

Hedetniemi , Total domination in graphs

E. J. Cockayne R. M. Dawes, T. S.
  • Networks
  • 1980