| P_m×P_n和P_m×C_n的邻强边染色 |
| |
| 引用本文： | 赵新梅,陈祥恩.P_m×P_n和P_m×C_n的邻强边染色[J].甘肃农业大学学报,2005,40(6):860-862. |
| |
| 作者姓名： | 赵新梅 陈祥恩 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,甘肃,兰州,730070 |
| |
| 摘 要： | 设G是阶数不小于3的简单连通图,G的κ-正常边染色称为是邻强的,如果对G任意相邻两顶点关联边的颜色构成的颜色集合不同,则κ中最小者称为是G的邻强边色数。本文研究了Pm×Pn和Pm×Cn的邻强边色数。
|
| 关 键 词： | 图 边染色 邻强边染色 |
| 文章编号： | 1003-4315(2005)06-0860-03 |
| 修稿时间： | 2005年3月14日 |
On the adjacent strong edge coloring of Pm×Pn and Pm×Cn |
| |
| ZHAO Xin-mei,CHEN Xiang-en.On the adjacent strong edge coloring of Pm×Pn and Pm×Cn[J].Journal of Gansu Agricultural University,2005,40(6):860-862. |
| |
| Authors: | ZHAO Xin-mei CHEN Xiang-en |
| |
| Abstract: | Let G be a simple connected graph with order not less than 3, k-proper edge coloring of G is called adjacent strong,if for arbitrary two adjacent vertices which are incident to different sets of colored edges. The minimum number required for an adjacent-strong edge coloring of G is called the adjacent strong edge chromatic number. The adjacent strong edge chromatic number of Pm×Pn and Pm×Cn, are ob tained in this paper. |
| |
| Keywords: | graph edge coloring adjacent strong edge coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
