| 广义Peterson图的邻点可区别的全染色 |
| |
| 引用本文： | 张东翰.广义Peterson图的邻点可区别的全染色[J].数学的实践与认识,2011,41(8). |
| |
| 作者姓名： | 张东翰 |
| |
| 作者单位： | 商洛学院数学与计算科学系,陕西商洛,726000 |
| |
| 基金项目： | 国家自然科学基金，商洛学院自然科学基金 |
| |
| 摘 要： | 设P_(n,k)是一个简单图,其顶点集和边集分别为:V(P_(n,k))={u_0,u_1,…u_(n-1),v_0,v_1,…v_(n-1)},E(P_(n,k))={u_iu_(i+1),u_iv_i,v_iv_(1+k)},则称P_(n,k)为广义Peterson图,其中n≥5,0
|
| 关 键 词： | 图 广义Peterson图 邻点可区别的全染色 |
The Adjacent Vertex Distinguishing Total Coloring of Extended Petersen Graph |
| |
| ZHANG Dong-han.The Adjacent Vertex Distinguishing Total Coloring of Extended Petersen Graph[J].Mathematics in Practice and Theory,2011,41(8). |
| |
| Authors: | ZHANG Dong-han |
| |
| Institution: | ZHANG Dong-han (The Department of Mathematics and Compute Science,Shangluo University,Shangluo 726000,China) |
| |
| Abstract: | Suppose P_(n,k) is a simple graph,whose vertex set and edge set are V(P_(n,k))= {u_0,u_1,…u_(n-1),v_0,v_1,…v_(n-1)} and E(P_(n,k)) = {u_iu_(i+1),u_iv_i,v_iv_(i+k)} respectively,then P_(n,k) is called extended Petersen graph,where n≥5,0
|
| |
| Keywords: | graph extended petersen graph the adjacent vertex distinguishing total coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
