|
|||||
|
|
| 若干联图的邻点可区别-点边全染色 | |
| 引用本文： | 强会英,张忠辅. 若干联图的邻点可区别-点边全染色[J]. 数学的实践与认识, 2011, 41(4) |
| 作者姓名： | 强会英 张忠辅 |
| 作者单位： | 兰州交通大学,应用数学研究所,甘肃,兰州,730070 |
| 基金项目： | 国家自然科学基金(10771091); 甘肃省自然科学基金(1010RJZA076); 甘肃省科技厅“十一五”规划课题GSBG(2009)GXG144 |
| 摘 要： | 设G(V,E)是简单图,k是正整数.从V(G)∪E(G)到{1,2,…,k}的映射f被称作G的邻点可区别-点边全染色,当且仅当:■uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),■uv∈E(G),C(u)≠C(v),且称最小的数k为G的邻点可区别-点边全色数.其中C(u)={f(u)}∪{f(uv)|uv∈E(G)},研究了一些联图的邻点可区别-点边全染色法,得到了它们的色数. |
| 关 键 词： | 联图 邻点可区别全染色 邻点可区别-点边全染色 |
The Adjacent Vertex Distinguishing Vertex-Edge Total Coloring of Some Join Graphs |
|
| QIANG Hui-ying,ZHANG Zhong-fu. The Adjacent Vertex Distinguishing Vertex-Edge Total Coloring of Some Join Graphs[J]. Mathematics in Practice and Theory, 2011, 41(4) | |
| Authors: | QIANG Hui-ying ZHANG Zhong-fu |
| Affiliation: | QIANG Hui-ying,ZHANG Zhong-fu (Institute of Applied Mathematics,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| Abstract: | Let G(V,E) is a simple graph,k is a positive integer.A mapping f from V(G)∪E(G) to {1,2,…,k} is called the adjacent vertex distinguishing vertex-edge total coloring of G iff■uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),■uv∈E(G),C(u)≠C(v) and the minimum number of k is called the adjacent vertex distinguishing vertex-edge total chromatic number of G,where C(u) = {f(u)}∪{f(uv)|uv G E(G)}.In this paper,the adjacent vertex distinguishing vertex-edge total coloring is studied,the adjacent vertex distinguishing vertexedge total chromatic number of the join graph of some spatial graphs is obtained. |
| Keywords: | join graph adjacent vertex distinguishing total coloring adjacent vertex distinguishing vertex-edge total coloring |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |