| 奇圈、偶圈与轮的多重联图的邻点可区别E-全染色(英文) |
| |
| 引用本文： | 李沐春,胡超,张忠辅.奇圈、偶圈与轮的多重联图的邻点可区别E-全染色(英文)[J].郑州大学学报(自然科学版),2009(2). |
| |
| 作者姓名： | 李沐春 胡超 张忠辅 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院 西北师范大学数学与信息科学学院 |
| |
| 基金项目： | 国家自然科学基金资助项目,编号10771091;; 甘肃省教育厅科研基金资助项目,编号0604-05 |
| |
| 摘 要： | G(V,E)是一个简单图,k是一个正整数,f是一个V(G)∪E(G)到{1,2,…,k}的映射,如果uv∈E(G),则f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),其中,C(u)={f(u)}∪{f(uv)|uv∈E(G)},称f是图G的邻点可区别E-全染色,称最小的数k为图G的邻点可区别E-全色数,给出了奇圈、偶圈与轮的多重联图的邻点可区别E-全色数.
|
| 关 键 词： | 多重联图 邻点可区别E-全染色 邻点可区别E-全色数 |
Adjacent Vertex-distinguishing E-total Coloring on the Multiple Join Graph of Odd Cycle,Even Cycle and Wheel |
| |
| LI Mu-chun,; HU Chao,; ZHANG Zhong-fu.Adjacent Vertex-distinguishing E-total Coloring on the Multiple Join Graph of Odd Cycle,Even Cycle and Wheel[J].Journal of Zhengzhou University (Natural Science),2009(2). |
| |
| Authors: | LI Mu-chun ; HU Chao ; ZHANG Zhong-fu |
| |
| Affiliation: | 1; 2(1.College of Mathematics; Physics and Software Engineering; Lanzhou Jiaotong University; Lanzhou 730070; China; 2.College of Mathematics and Information Science; Northwest Normal University; 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 of G.The number χeat(G)=min {k|G has a k-AVDETC} is called the adjacent vertex-distinguishing E-total chromatic number of G.The adjacent vertex-distinguishing E-total chromatic numbers of the multiple join graph of odd cycle,even cycle and wheel are o... |
| |
| Keywords: | multiple join graph adjacent vertex-distinguishing E-total coloring adjacent vertex-distinguishing E-total chromatic number |
| 本文献已被 维普 等数据库收录！ |
|
