An Upper Bound for Total Domination Number

Sun Liang. An Upper Bound for Total Domination Number[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 111-113.

Citation:

Sun Liang. An Upper Bound for Total Domination Number[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 111-113.

Citation:

Sun Liang. An Upper Bound for Total Domination Number[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 1995, 4(2): 111-113.

Abstract

Let G=(V, E) be a simple graph without an isolate. A subset T of V is a total dominating set of G if for any there exists at least one vertex such that .The total domination number γ1(G) of G is the minimum order of a total dominating set of G. This paper proves that if G is a connected graph with n≥3 vertices and minimum degree at least two.

FullText(HTML)

Export File