| 关于D(F_n)和D(W_n)的点关联邻点可区别全色数 |
| |
| 引用本文： | 晁福刚,张忠辅,曹艳华.关于D(F_n)和D(W_n)的点关联邻点可区别全色数[J].数学的实践与认识,2009,39(24). |
| |
| 作者姓名： | 晁福刚 张忠辅 曹艳华 |
| |
| 作者单位： | 1. 井冈山大学数理学院,江西,吉安,343009
2. 兰州交通大学应用数学研究所,甘肃,兰州,730070 |
| |
| 基金项目： | 国家自然科学基金，井冈山大学自然科学基金 |
| |
| 摘 要： | 对简单图G(V,E),f是从V(G)∪E(G)到{1,2,…,k}的映射,k是自然数,若满足:1)uv,uω-∈E(G),v≠,-ωf(uv)≠f (uω-);2)uv∈E G,C(u)≠C(v).则称f是G的点关联邻点可区别全染色法,其所用到的最少颜色数称为图G的点关联邻点可区别全色数.这里C(u)=f(u)∪f(uv)uv∈E(G).得到了扇和轮的倍图的点关联邻点可区别全色数.
|
| 关 键 词： | 扇 轮 倍图 点关联邻点可区别全色数 |
On the Vertex Incidence-adjacent Vertex-distinguishing Total Coloring of D(Fn) and D(Wn) |
| |
| Abstract: | Let G be a simple graph,k is a positive integer.f is a mapping from V(G)∪E(G) to {1,2,…,k} such that uv∈E(G),then uv,uω-∈E(G),v≠ω-,f(uv)≠f(uω-);uv∈E(G),C(u)≠C(v),we say that f is the vertex incidence-adjacent vertex distinguishing total coloring of G.The minimal number of k is called the vertex incidence-adjacent vertex distinguishing total chromatic number of G,where C(u)={f(u)}∪{f(uv)|uv∈E(G)}.In this paper,we discuss the vertex incidence-adjacent vertex distinguishing total chromatic number of the double graph of Fan and Wheel. |
| |
| Keywords: | fan wheel double graph vertex incidence-adjacent vertex distingushing total chromatic number |
| 本文献已被 万方数据 等数据库收录！ |
|
