| k-方图的一般邻点可区别边染色 |
| |
| 引用本文： | 严谦泰. k-方图的一般邻点可区别边染色[J]. 安徽大学学报(自然科学版), 2010, 34(3) |
| |
| 作者姓名： | 严谦泰 |
| |
| 作者单位： | 安阳师范学院,数学与统计学院,河南,安阳,455002 |
| |
| 摘 要： | 已有的文献中,起源于网络问题的点可区别边染色和邻点可区别边染色问题得到广泛研究.Gyri E,Hornak M,Palmer C,等提出了一般邻点可区别边染色的定义,并且给出了路、圈、树的一般邻点可区别色指标.作者给出了两类k-方图的一般邻点可区别色指标,并提出一个猜想.
|
| 关 键 词： | 一般邻点可区别边染色 一般邻点可区别色指标 k-方图 |
On the general neighbor-distinguishing edge coloring of k-th power graphs |
| |
| YAN Qian-tai. On the general neighbor-distinguishing edge coloring of k-th power graphs[J]. Journal of Anhui University(Natural Sciences), 2010, 34(3) |
| |
| Authors: | YAN Qian-tai |
| |
| Abstract: | Adjacent vertex-distinguishing edge coloring and adjacent vertex-distinguishing edge coloring that origined from net problems were widely studied by many authors.Gyri E,Hornak M,Palmer C,et al proposed the general neighbor-distinguishing coloring and gave general neighbor-distinguishing chromatic indexs of paths,cycles and trees.The general neighbor-distinguishing chromatic index of two classes k-cube graphs and a conjecture were given. |
| |
| Keywords: | general neighbor-distinguishing edge coloring general neighbor-distinguishing chromatic index k-th power graphs |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
