| 关于一类二部图的均匀邻点可区别全染色 |
| |
| 引用本文： | 严谦泰,李武装.关于一类二部图的均匀邻点可区别全染色[J].大学数学,2009,25(3). |
| |
| 作者姓名： | 严谦泰 李武装 |
| |
| 作者单位： | 安阳师范学院,数学系,河南,安阳,455002 |
| |
| 摘 要： | 若图的邻点可区别全染色的各色所染元素数之差不超过1,则称该染色法为图的均匀邻点可区别全染色,而所用的最少颜色数称为该图的均匀邻点可区别全色数.本文给出了一类二部图的均匀邻点可区别全染色数.
|
| 关 键 词： | 图 染色 邻点可区别全染色 均匀邻点可区别全染色数 二部图 |
On the Equitable Adjacent Vertex-distinguishing Total Coloring of k-regular Bipartite Graphs |
| |
| YAN Qian-tai,LI Wu-zhuang.On the Equitable Adjacent Vertex-distinguishing Total Coloring of k-regular Bipartite Graphs[J].College Mathematics,2009,25(3). |
| |
| Authors: | YAN Qian-tai LI Wu-zhuang |
| |
| Institution: | Depart.of Maths.;Anyang Normal University;Anyang;Henan 455002;China |
| |
| Abstract: | We propose the notion of equitable adjacent vertex-distinguishing total coloring of graphs.k-regular bipartite graphs is proved that the charmotic number of equital adjacent vertex-distinguish total coloring is k+2. |
| |
| Keywords: | graph coloring adjacent vertex-distinguishing total coloring equitable adjacent vertex-distinguish total coloring chromatic number bipartite graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
