|
| 摘要: |
| 本文研究了最大度为6的图G的邻点可区别边着色问题.利用反证法，得到了最大度为6的非半正则图G的邻点可区别边色数的一个上界. |
| 关键词: 最大度 邻点可区别边着色 邻点可区别边色数 |
| DOI： |
| 分类号:O157.5 |
| 基金项目: |
|
| AN UPPER BOUND ON ADJACENT VERTEX-DISTINGUISHING CHROMATIC INDEX OF GRAPHS WITH MAXIMUM DEGREE SIX |
|
WU Yan-qing
|
| Abstract: |
| In this paper, we discuss the problem of the adjacent vertex distinguishing edge coloring on the graph with maximum degree six. By using reduction to absurdity, an upper bound on the adjacent vertex distinguishing chromatic index for the graph G which is not a semi-regular graph with maximum degree six is obtained. |
| Key words: maximum degree adjacent vertex distinguishing edge coloring adjacent vertex distinguishing chromatic index |
