Paper Info
Title
Upper Bounds on the Total Domination Number.
Abstract
A total dominating set of a graph G with no isolated vertex is a set S 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.
Year
Venue
Keywords
2009
ARS COMBINATORIA
diameter,girth,minimum degree,total domination
DocType
Volume
ISSN
Journal
91
0381-7032
Citations 
PageRank 
References 
4
0.46
2
Authors
2
Name
Order
Citations
PageRank
Teresa W. Haynes177494.22
Michael A. Henning21865246.94