Title
Upper Bounds on the Total Domination Number
Document Type
Article
Publication Date
4-1-2009
Description
A total dominating set of a graph G with no isolated vertex is a set 5 of vertices of G such that every vertex is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set in G. In this paper, we present several upper bounds on the total domination number in terms of the minimum degree, diameter, girth and order.
Citation Information
Haynes, Teresa W.; and Henning, Michael A.. 2009. Upper Bounds on the Total Domination Number. Ars Combinatoria. Vol.91 243-256. ISSN: 0381-7032