经济数学2002，Vol.19Issue(3)：15-18,4.
图 P2×Cn的均匀邻强边色数
ON THE EQUITABLE ADJACENT STRONG EDGE CHROMATICS NUMBER OF P2 × Cn
摘要
Abstract
Let G(V,E) be a simple connected graph with order not less than 3. A proper k-edge coloring f of G(V,E) be called a k-equitable adjacent strong edge coloring, be abbreviatted a k-ASEC, of G(V,E) iff every uv ∈ E (C) have f[u]≠ f[v] and || Ei] - |Ej|| ≤1, where f[x]= {f(wx) |wx ∈ E (G) }, f (ux) is the color of edge wx∈E(G), and Ek= {e|e∈E(G) and f(e)=k}; and Xcax(G)=min{k |there is a k-EASEC of G} be called the equitable adjacent strong edge chromatics number of G(V,E). In this paper, we present some results about equitable adjacent strong edge chromatics number of graph P2 ×Cn.关键词
图/邻强边染色/均匀邻强边染色Key words
graph/graph Coloring/equitable adjacent strong edge coloring分类
数理科学引用本文复制引用
Sheng Bau,李明哲,刘林忠,张忠辅..图 P2×Cn的均匀邻强边色数[J].经济数学,2002,19(3):15-18,4.基金项目
This research is supported by NSFC(No. 19871036) and University of Natal URF Grant （No. 19871036）
