| 关于图的一般邻点可区别全染色 |
| |
| 引用本文： | 严谦泰.关于图的一般邻点可区别全染色[J].系统科学与数学,2010,30(1):101-106. |
| |
| 作者姓名： | 严谦泰 |
| |
| 作者单位： | 安阳师范学院数学与统计学院,安阳,455002 |
| |
| 摘 要： | 提出了一般邻点可区别全染色的新概念,给出了路、圈、星、树、二部图、轮、扇、完全图的一般邻点可区别全染色指标.并据此提出猜想.
|
| 关 键 词： | 一般邻点可区别边染色 一般邻点可区别全染色 一般邻点可区别全染色指标. |
| 收稿时间： | 2008-8-27 |
| 修稿时间： | 2009-3-24 |
THE GENERAL NEIGHBOR-DISTINGUISHING TOTAL COLORING OF GRAPHS |
| |
| YAN Qiantai.THE GENERAL NEIGHBOR-DISTINGUISHING TOTAL COLORING OF GRAPHS[J].Journal of Systems Science and Mathematical Sciences,2010,30(1):101-106. |
| |
| Authors: | YAN Qiantai |
| |
| Institution: | School of Mathematics and Statistics, Anyang Normal University, Anyang 455002 |
| |
| Abstract: | In this paper, a new notion is proposed that is the general neighbor-istinguishing total coloring. The general neighbor-distinguishing total coloring chromatic index of the paths $P_n$, cycles $C_n$, stars $S_n$, fans $F_n$wheel graphs $W_n$, bipartite graphs $G\langle V_1,V_2,E\rangle$, trees $T_n$ and complete graphs $K_n$ are given. |
| |
| Keywords: | General neighbor-distinguishing edge coloring general neighbor-distinguishing total coloring general neighbor-distinguishing total coloring chromatic index |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 |
|
