On distance connected domination numbers of graphs

CORC > 上海财经大学 > 上海财经大学

	On distance connected domination numbers of graphs
	Tian, Fang ; Xu, Jun-Ming
刊名	ARS COMBINATORIA
	2007-07
卷号	84 页码:357-367
关键词	domination connected k-domination number distance
ISSN号	0381-7032
英文摘要	Let k be a positive integer and G = (V, E) be a connected graph of order n. A set D subset of V is called a k-dominating set of G if each x is an element of V(G) - D is within distance k from some vertex of D. A connected k-dominating set is a k-dominating set that induces a connected subgraph of G. The connected k-domination number of G, denoted by gamma(c)(k)(G), is the minimum cardinality of a connected k-dominating set. Let 6 and A denote the minimum and the maximum degree of G, respectively. This paper establishes that gamma(c)(k)(G) <= max {1, n - 2k - Delta + 2}, and gamma(c)(k)(G) <= (1+o(delta)(1))n ln[m(delta+1)+2-t]/m(delta+1)+2-t, where m = [k/3], t = 3[k/3] - k, and o(delta)(1) denotes a function that tends to 0 as delta -> infinity. The later generalizes the result of Caro et al's in [Connected domination and spanning trees with many leaves. SIAM J. Discrete Math. 13 (2000), 202-211] for k = 1.
WOS研究方向	Mathematics
语种	英语
出版者	CHARLES BABBAGE RES CTR
WOS记录号	WOS:000248426900031
内容类型	期刊论文
源URL	[http://10.2.47.112/handle/2XS4QKH4/2590]
专题	上海财经大学
通讯作者	Tian, Fang
作者单位	1.Univ Sci & Technol, Dept Math, Hefei 230026, Peoples R China; 2.Shanghai Univ Finance & Econ, Shanghai 200433, Peoples R China
推荐引用方式 GB/T 7714	Tian, Fang,Xu, Jun-Ming. On distance connected domination numbers of graphs[J]. ARS COMBINATORIA,2007,84:357-367.
APA	Tian, Fang,&Xu, Jun-Ming.(2007).On distance connected domination numbers of graphs.ARS COMBINATORIA,84,357-367.
MLA	Tian, Fang,et al."On distance connected domination numbers of graphs".ARS COMBINATORIA 84(2007):357-367.