Adjacent strong edge coloring of graphs

CSpace

	Adjacent strong edge coloring of graphs
	Zhang, ZF ; Liu, LZ ; Wang, JF
	2002-07-01
发表期刊	APPLIED MATHEMATICS LETTERS
ISSN	0893-9659
卷号	15 期号:5 页码:623-626
摘要	For a graph G(V, E), if a proper k-edge coloring f is satisfied with C(u) not equal C(v) for uv is an element of E(G), where C(u) = {f (uv) \ uv is an element of E}, then f is called k-adjacent strong edge coloring of G, is abbreviated k-ASEC, and chi'(as)(G) = min{k \ k-ASEC of G} is called the adjacent strong edge chromatic number of G. In this paper, we discuss some properties of chi'(as)(G), and obtain the chi'(as)(G) of some special graphs and present a conjecture: if G are graphs a whose order of each component is at least six, then chi'(as)(G) less than or equal to Delta(G) + 2, where Delta(G) is the maximum a degree of G. (C) 2002 Elsevier Science Ltd. All rights reserved.
关键词	graph adjacent strong edge coloring adjacent strong edge coloring chromatic number
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000175800800015
出版者	PERGAMON-ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17673
专题	中国科学院数学与系统科学研究院
通讯作者	Zhang, ZF
作者单位	1.Lanzhou Railway Inst, Inst Appl Math, Lanzhou 730070, Peoples R China 2.Lanzhou Railway Inst, Dept Transport, Lanzhou 730070, Peoples R China 3.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, ZF,Liu, LZ,Wang, JF. Adjacent strong edge coloring of graphs[J]. APPLIED MATHEMATICS LETTERS,2002,15(5):623-626.
APA	Zhang, ZF,Liu, LZ,&Wang, JF.(2002).Adjacent strong edge coloring of graphs.APPLIED MATHEMATICS LETTERS,15(5),623-626.
MLA	Zhang, ZF,et al."Adjacent strong edge coloring of graphs".APPLIED MATHEMATICS LETTERS 15.5(2002):623-626.