| 轮与星的多重联图的邻点可区别E-全染色 |
| |
| 引用本文： | 张威,李沐春,张忠辅.轮与星的多重联图的邻点可区别E-全染色[J].数学的实践与认识,2010,40(7). |
| |
| 作者姓名： | 张威 李沐春 张忠辅 |
| |
| 作者单位： | 1. 华南师范大学,物理与电信工程学院,广东,广州,510631
2. 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070 |
| |
| 摘 要： | G(V,E)是一个简单图,k是一个正整数,f是一个V(G)UE(G)到{1,2,…,k}的映射.如果■u,v∈V(G),则f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),称f是图G的邻点可区别E-全染色,称最小的数k为图G的邻点可区别E-全色数.给出了轮与星的多重联图的邻点可区别E-全色数.
|
| 关 键 词： | 多重联图 邻点可区别E-全染色 邻点可区别E-全色数 |
Adjacent Vertex-distinguishing E-total Coloring on the Multiple Join Graph of Wheel and Star |
| |
| ZHANG Wei,LI Mu-chun,ZHANG Zhong-fu.Adjacent Vertex-distinguishing E-total Coloring on the Multiple Join Graph of Wheel and Star[J].Mathematics in Practice and Theory,2010,40(7). |
| |
| Authors: | ZHANG Wei LI Mu-chun ZHANG Zhong-fu |
| |
| Institution: | ZHANG Wei~1,LI Mu-chun~2,ZHANG Zhong-fu~2 (1.College of Mathematics Physics , Engineering,South China Nomal University,Guangzhou 510631,China) (2.College of Mathematics,Physics , software Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| |
| Abstract: | Let G(V,E) be a simple graph,k be a positive integer,f be a mapping from V(G)∪E(G) to {1,2,…,k}.If■uv∈E(G),we have f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.Then f is called the adjacent vertex-distinguishing E-total coloring.The minimal number of k is called the adjacent vertexdistinguishing E-total chromatic number of G.The adjacent vertex-distinguishing E-total chromatic number of the multiple join graph of wheel and star are obtained in this paper. |
| |
| Keywords: | the multiple join graph adjacent vertex-distinguishing E-total coloring adjacent vertex-distinguishing E-total chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
