On Trees Attaining an Upper Bound on the Total Domination Number

@inproceedings{Krzywkowski2014OnTA,
  title={On Trees Attaining an Upper Bound on the Total Domination Number},
  author={Marcin Krzywkowski},
  year={2014}
}
A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γt(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1… CONTINUE READING