|
|||||
|
|
| 图 P2×Cn的均匀邻强边色数 | |
| 引用本文： | Sheng Bau,李明哲,刘林忠,张忠辅.图 P2×Cn的均匀邻强边色数[J].经济数学,2002,19(3):15-18. |
| 作者姓名： | Sheng Bau 李明哲 刘林忠 张忠辅 |
| 作者单位： | 1. Dept. of Mathematics. , University Natal Pietermatritiburg, South Africa 2. 福冈大学经济学院,福冈814-0180,日本 3. 兰州铁道学院系统科学研究所,兰州,730070 4. 兰州铁道学院应用数学研究所,兰州,730070 |
| 基金项目： | NSFC( No.198710 36 )，U niversity of Natal URF Grant |
| 摘 要： | 对图G(V,E),一正常边染色f若满足(1)对(V)uv∈E(G),fu]≠fv],其中fu]={f(uv)|uv∈E};(2)对任意i≠j,有||E|-|Ej||≤1,其中Ei={e|
e∈E(G)且f(e)=i}.则称f为G(V,E)的一k-均匀邻强边染色,简称k-EASC,并且称Xcas(G)=min{k|存在G(V,E)的一k-EASC为G(V,E)的均匀邻强边色数.本文得到了图P2×Cn的均匀邻强边色数. |
| 关 键 词： | 图 邻强边染色 均匀邻强边染色. |
ON THE EQUITABLE ADJACENT STRONG EDGE CHROMATICS NUMBER OF P2 × Cn |
|
| Sheng Bau.ON THE EQUITABLE ADJACENT STRONG EDGE CHROMATICS NUMBER OF P2 × Cn[J].Mathematics in Economics,2002,19(3):15-18. | |
| Authors: | Sheng Bau |
| 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 fu]≠ fv] and || Ei] - |Ej|| ≤1, where fx]= {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. |
| Keywords: | graph graph Coloring equitable adjacent strong edge coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |