| 中间图的邻点强可区别全染色 |
| |
| 引用本文： | 卢建立,任凤霞,马美琳. 中间图的邻点强可区别全染色[J]. 河南师范大学学报(自然科学版), 2012, 40(5): 13-16 |
| |
| 作者姓名： | 卢建立 任凤霞 马美琳 |
| |
| 作者单位： | 河南师范大学数学与信息科学学院,河南新乡,453007 |
| |
| 基金项目： | 河南省杰出青年计划(084100510013);河南省高校科技创新人才支持计划(2008HASTIT023) |
| |
| 摘 要： | 通过分类讨论、归纳探究,在图的点边集合与色集合间构造了一种一一对应关系来研究路和圈的中间图的邻点强可区别全染色,并得到了它们的邻点强可区别全染色数.
|
| 关 键 词： | 路 圈 中间图 邻点强可区别全染色 |
Adjacent Vertex Strongly Distinguishing Total Coloring on the Middle Graphs |
| |
| LU Jian-li , REN Feng-xia , MA Mei-lin. Adjacent Vertex Strongly Distinguishing Total Coloring on the Middle Graphs[J]. Journal of Henan Normal University(Natural Science), 2012, 40(5): 13-16 |
| |
| Authors: | LU Jian-li REN Feng-xia MA Mei-lin |
| |
| Affiliation: | (College of Mathematics and Information Science,Henan Normal University,Xinxiang 453007,China) |
| |
| Abstract: | Through the classification discussion and inductive exploration,adjacent vertex strongly distinguishing total coloring for the middle graphs of path and circle are studied in this paper,the adjacent vertex strongly distinguishing total chromatic number is obtained for the middle graphs of path and circle. |
| |
| Keywords: | path circle middle graph adjacent vertex strongly distinguishing total coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
