| 关于若干倍图的关联邻点可区别边全染色 |
| |
| 引用本文： | 杨晓亚,杨随义,王三福.关于若干倍图的关联邻点可区别边全染色[J].天水师范学院学报,2010,30(2):29-31. |
| |
| 作者姓名： | 杨晓亚 杨随义 王三福 |
| |
| 作者单位： | 1. 青岛科技大学,信息科学技术学院,山东,青岛,266061;天水师范学院数学与统计学院,甘肃,天水,741001
2. 天水师范学院数学与统计学院,甘肃,天水,741001 |
| |
| 摘 要： | 应用关联邻点可区别边染色，给出了路、圈、星、扇、轮及完全图倍图的关联邻点可区别边全染色数．
|
| 关 键 词： | 倍图 关联邻点可区别边全染色 关联邻点可区别边全色数 |
On a Number of Incidence Adjacent Vertex Distinguishing Edge Total Coloring of Double Graphs |
| |
| Yang Xiaoya,Yang Suiyi,Wang Sanfu.On a Number of Incidence Adjacent Vertex Distinguishing Edge Total Coloring of Double Graphs[J].Journal of Tianshui Normal University,2010,30(2):29-31. |
| |
| Authors: | Yang Xiaoya Yang Suiyi Wang Sanfu |
| |
| Institution: | 1. College oflnformaiton Sicence＆Technology, Qingdao University ofSicence＆Technology ,Qingdao Shandong 266061, China; 2. School of Mathematics and Statistics, Tianshui Normal University, Tianshui Gansu 741001, China) |
| |
| Abstract: | The incident vertex distinguishing edge total chromatic number of the double graph of path, circle, star, fan wheel and complete graph were given by using incident vertex distinguishing edge total coloring of graph in this paper. |
| |
| Keywords: | double graph incident adjacent vertex distinguishing total coloring incident adjacent vertex distingui- shing edge chromatic number |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
