On the total domination number of graphs

	On the total domination number of graphs
	Lam, Peter Che Bor ; Wei, Bing
刊名	UTILITAS MATHEMATICA
	2007-03-01
卷号	72 页码:223-240
ISSN号	0315-3681
英文摘要	Let G be a graph of order n with minimum degree at least two and S-2 be a vertex set consisting of all vertices of degree two in G. We call a vertex set T a total dominating set if for any vertex u is an element of V(G) there exists some vertex u is an element of T such that u is an element of N(v). The total domination number denoted by gamma(t)(G) is the minimum cardinality of the total dominating sets. In this paper, we will prove that gamma(t)(G) <= n/2 if the length of the longest paths in the subgraph induced by S-2 is at most one. As a consequence, we have that gamma(t)(G) <= n/2 if the minimum degree of G is at least three.
WOS研究方向	Mathematics
语种	英语
出版者	UTIL MATH PUBL INC
WOS记录号	WOS:000245796200018
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/5155]
专题	中国科学院数学与系统科学研究院
通讯作者	Lam, Peter Che Bor
作者单位	1.Hong Kong Baptist Univ, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Univ Mississippi, Dept Math, University, MS 38677 USA 3.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Lam, Peter Che Bor,Wei, Bing. On the total domination number of graphs[J]. UTILITAS MATHEMATICA,2007,72:223-240.
APA	Lam, Peter Che Bor,&Wei, Bing.(2007).On the total domination number of graphs.UTILITAS MATHEMATICA,72,223-240.
MLA	Lam, Peter Che Bor,et al."On the total domination number of graphs".UTILITAS MATHEMATICA 72(2007):223-240.