|
|||||
|
|
| 一类4-正则平面图的邻点可区别关联色数 | |
| 引用本文： | 张丽,陈宏宇,袁西英.一类4-正则平面图的邻点可区别关联色数[J].数学的实践与认识,2012,42(19). |
| 作者姓名： | 张丽 陈宏宇 袁西英 |
| 作者单位： | 1. 上海金融学院应用数学系,上海,201209 2. 上海应用技术学院理学院,上海20418 3. 上海大学理学院,上海,200444 |
| 摘 要： | 所谓图R_n是指具有如下结构的平面图:R_n=(V,E),其中顶点集合V={u_1,u_2,…,u_n}U{v_1,v_2,…,v_n},边集合E={u_iu_(i+1),v_iv_(i+1),u_iv_i,u_iv_(i+1)|i=1,2,…,n},其中u_(n+1)=u_1,v_(n+1)=v_1.通过研究R_n的邻点可区别关联着色,给出了当n=4,n是3或者5的正整数倍时,R_n的邻点可区别关联色数. |
| 关 键 词： | 4-正则平面图 邻点可区别关联着色 邻点可区别关联色数 |
The Adjacent Vertex Distinguishing Incidence Coloring Numbers of a Class of 4-Regular Planar Graphs |
|
| ZHANG Li , CHEN Hong-yu , YUAN Xi-ying.The Adjacent Vertex Distinguishing Incidence Coloring Numbers of a Class of 4-Regular Planar Graphs[J].Mathematics in Practice and Theory,2012,42(19). | |
| Authors: | ZHANG Li CHEN Hong-yu YUAN Xi-ying |
| Abstract: | The graph R_n is defined by R_n =(V,E),V = {u_1,u_2,…u_n}∪{v_1,v_2,…,v_n} and E = {u_iu_i+1,v_iv_(i+1),u_iv_i,u_iv_(i+1)|i=1,2,…,n},where u_(n+1)=u_1,v_(n+1)= v_1.By studying the adjacent vertex distinguishing incidence coloring of R_n,we determine the adjacent vertex distinguishing incidence coloring numbers of them,when n = 4,n = 3k or n = 5k(k is a positive integer). |
| Keywords: | 4-regular planar graph adjacent vertex distinguishing incidence coloring adjacent vertex distinguishing incidence coloring number |
| 本文献已被 万方数据 等数据库收录！ | |