| 若干笛卡尔积图的邻点可区别E-全染色 |
| |
| 引用本文： | 李沐春,张忠辅.若干笛卡尔积图的邻点可区别E-全染色[J].数学的实践与认识,2009,39(3). |
| |
| 作者姓名： | 李沐春 张忠辅 |
| |
| 作者单位： | 1. 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070
2. 兰州交通大学,数理与软件工程学院,甘肃,兰州,730070;西北师范大学,数学与信息科学学院,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金，甘肃省教委基金 |
| |
| 摘 要： | 图G(V,E)的k是一个正整数,f是V(G)∪E(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-全色数.得到了Pm×Pn,Pm×Cn,Cm×Cn的邻点可区别E-全色数,其中C(u)={f(u)}∪{f(uv)uv∈E(G)}.
|
| 关 键 词： | 路 圈 笛卡尔积 邻点可区别E-全色数 |
Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs |
| |
| LI Mu-chun,ZHANG Zhong-fu.Adjacent Vertex-distinguishing E-total Coloring on Product of Graphs of Some Graphs[J].Mathematics in Practice and Theory,2009,39(3). |
| |
| Authors: | LI Mu-chun ZHANG Zhong-fu |
| |
| 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 u,v∈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 minimal number of k is called the adjacent vertex-distinguishing E-total chromatic number of G.this paper obtained adjacent vertex-distinguishing E-total chromatic number of Pm×Pn,Pm×Cn,Cm×Cn. |
| |
| Keywords: | path circle product of graphs adjacent vertex-distinguishing E-total coloring |
| 本文献已被 万方数据 等数据库收录！ |
|
