ON THE CHROMATIC UNIQUENESS OF THE GRAPH W(N, N-2)+K-K

CSpace

	ON THE CHROMATIC UNIQUENESS OF THE GRAPH W(N, N-2)+K-K
	DONG, FM; LIU, YP
	1995-10-13
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	145 期号:1-3 页码:95-103
摘要	Let W(n,m) denote the graph of order n obtained from the wheel W,be deleting all but m consecutive spokes, and W(n, n - 2) + K-k, the join of W(n, n - 2) and K-k, which is obtained from the union of W(n,n - 2) and K-k by joining each vertex in K-k. In this paper, we prove that the graph W(n, n - 2) + K-k is chromatically unique for each integer n greater than or equal to 6 and integer k greater than or equal to 0.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:A1995TA36800007
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/27551
专题	中国科学院数学与系统科学研究院
作者单位	CHINESE ACAD SCI,INST APPL MATH,BEIJING 100080,PEOPLES R CHINA
推荐引用方式 GB/T 7714	DONG, FM,LIU, YP. ON THE CHROMATIC UNIQUENESS OF THE GRAPH W(N, N-2)+K-K[J]. DISCRETE MATHEMATICS,1995,145(1-3):95-103.
APA	DONG, FM,&LIU, YP.(1995).ON THE CHROMATIC UNIQUENESS OF THE GRAPH W(N, N-2)+K-K.DISCRETE MATHEMATICS,145(1-3),95-103.
MLA	DONG, FM,et al."ON THE CHROMATIC UNIQUENESS OF THE GRAPH W(N, N-2)+K-K".DISCRETE MATHEMATICS 145.1-3(1995):95-103.