Distance-dominating cycles in quasi claw-free graphs

	Distance-dominating cycles in quasi claw-free graphs
	Chen, CP ; Harkat-Benhamdine, A ; Li, H
刊名	GRAPHS AND COMBINATORICS
	1999
卷号	15 期号:3 页码:279-285
ISSN号	0911-0119
英文摘要	We say that a graph G is quasi claw-free if every pair (a(1),a(2)) of vertices at distance 2 satisfies {u is an element of N(a(1)) boolean AND N(a(2)) \N[u] subset of or equal to N[a(1)] boolean OR N[a(2)]} not equal empty set. A cycle C is m-dominating if every vertex of G is of distance at most m from C. We prove that if G is a kappa-connected (kappa greater than or equal to 2) quasi claw-free graph then either G has an m-dominating cycle or G has a set of at least kappa + 1 vertices such that the distance between every pair of them is at least 2m + 3.
WOS研究方向	Mathematics
语种	英语
出版者	SPRINGER VERLAG
WOS记录号	WOS:000087242700003
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/14054]
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, CP
作者单位	1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.Univ Paris Sud, LRI, CNRS, URA 410, F-91405 Orsay, France
推荐引用方式 GB/T 7714	Chen, CP,Harkat-Benhamdine, A,Li, H. Distance-dominating cycles in quasi claw-free graphs[J]. GRAPHS AND COMBINATORICS,1999,15(3):279-285.
APA	Chen, CP,Harkat-Benhamdine, A,&Li, H.(1999).Distance-dominating cycles in quasi claw-free graphs.GRAPHS AND COMBINATORICS,15(3),279-285.
MLA	Chen, CP,et al."Distance-dominating cycles in quasi claw-free graphs".GRAPHS AND COMBINATORICS 15.3(1999):279-285.