Harmonious graphs C-2k boolean OR C2j+1

CSpace

	Harmonious graphs C-2k boolean OR C2j+1
	Yang, YS ; Lu, WM ; Zeng, QS
	2002-11-01
发表期刊	UTILITAS MATHEMATICA
ISSN	0315-3681
卷号	62 页码:191-198
摘要	In this article, we show that the disjoint union C-2k boolean OR C2j+1 of cycles CA and C2j+1 ( k greater than or equal to 2,j greater than or equal to 1, (k,j) not equal (2,1)) is harmonious.
关键词	harmonious graphs harmonious labeling edge label vertex label
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Statistics & Probability
WOS记录号	WOS:000179984000016
出版者	UTIL MATH PUBL INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17733
专题	中国科学院数学与系统科学研究院
作者单位	1.Dalian Univ Technol, Dept Comp Sci & Engn, Dalian 116024, Peoples R China 2.Chinese Acad Sci, Inst Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Yang, YS,Lu, WM,Zeng, QS. Harmonious graphs C-2k boolean OR C2j+1[J]. UTILITAS MATHEMATICA,2002,62:191-198.
APA	Yang, YS,Lu, WM,&Zeng, QS.(2002).Harmonious graphs C-2k boolean OR C2j+1.UTILITAS MATHEMATICA,62,191-198.
MLA	Yang, YS,et al."Harmonious graphs C-2k boolean OR C2j+1".UTILITAS MATHEMATICA 62(2002):191-198.