| P_n~2和P_n~(n-1)的均匀邻强边色数 |
| |
| 引用本文： | 田双亮,李敬文,张忠辅.P_n~2和P_n~(n-1)的均匀邻强边色数[J].数学的实践与认识,2006(3). |
| |
| 作者姓名： | 田双亮 李敬文 张忠辅 |
| |
| 作者单位： | 西北民族大学数学系 甘肃兰州730030(田双亮)，兰州交通大学信电学院 甘肃兰州730070(李敬文)，兰州交通大学应用数学研究所 甘肃兰州730070(张忠辅) |
| |
| 摘 要： | 对阶至少为3的简单连通图G的k-正常边染色法f,若对任意uv∈E(G)有C(u)≠C(v),Ei-Ej 1,i,j=1,2,…,k.其中C(u)={f(uv)uv∈E(G)},Ei={uv f(uv)=i,uv∈E(G)},则称f为G的一k-均匀邻强边染色,简称k-EASEC.并称χe′as(G)=min{k k-EASEC of G}为G的均匀邻强边色数.给出了图Pn2与Pnn-1的均匀邻强边色数.
|
| 关 键 词： | 路 m方图 均匀邻强边色数 |
On the Equitable Adjacent Strong Edge Chromatic Number of P_n~2 and P_n~(n-1) |
| |
| TIAN Shuang-liang,LI Jing-wen,ZHANG Zhong-fu.On the Equitable Adjacent Strong Edge Chromatic Number of P_n~2 and P_n~(n-1)[J].Mathematics in Practice and Theory,2006(3). |
| |
| Authors: | TIAN Shuang-liang LI Jing-wen ZHANG Zhong-fu |
| |
| Institution: | TIAN Shuang-liang~1,LI Jing-wen~2,ZHANG Zhong-fu~3 |
| |
| Abstract: | Let G be a simple connected graph with order not less than 3.A proper k-edge coloring f of G be called a k-equitable adjacent strong edge coloing,be abbreviatted a k-EASEC of G,iff every uv∈E(G) have C(u)≠C(v) and ||E_i|-|E_j||1,i,j=1,2,…,k,where C(u)={f(uv)|uv∈E(G)} and E_i={uv|f(uv)=i,uv∈E(G)}.χ~(′)_(eas)(G)=min{k|k-EASEC of G} be called the equitable adjacent strong edge chromatic number of G.In this paper,we present the equitable adjacent strong edge chromatic number of P~2_n and P~(n-1)_n. |
| |
| Keywords: | path mth power of graph equitable adjacent strong edge chromatic number |
| 本文献已被 CNKI 等数据库收录！ |
|
