| 一些图的倍图与Mycielski图的邻点可区别VE-全染色 |
| |
| 引用本文： | 强会英.一些图的倍图与Mycielski图的邻点可区别VE-全染色[J].数学的实践与认识,2012,42(7):244-249. |
| |
| 作者姓名： | 强会英 |
| |
| 作者单位： | 兰州交通大学数理与软件工程学院,甘肃兰州,730070 |
| |
| 基金项目： | 国家自然科学基金项目，甘肃省自然科学基金，甘肃省科技厅“十一五”规划课题 |
| |
| 摘 要： | 对简单图G(V,E),存在一个正整数κ,使得映射f:V(G)U E(G)→{1,2…,κ},如果对uv∈E(G),有f(u)≠f(uv),f(v)≠f(uv),且C(u)≠C(v),则称f是图G的邻点可区别VE-全染色,且称最小的数κ为图G的邻点可区别VE-全色数,讨论了路、圈、星、扇、轮等一些图的倍图与Mycielski图的邻点可区别VE-全色数。
|
| 关 键 词： | 倍图 Mycieskie图 邻点可区别VE-全染色 邻点可区别VE-全色数 |
Adjacent Vertex-Distinguishing VE-total Coloring of the Double Graph and Mycielski Graph of Some Graphs |
| |
| QIANG Hui-ying.Adjacent Vertex-Distinguishing VE-total Coloring of the Double Graph and Mycielski Graph of Some Graphs[J].Mathematics in Practice and Theory,2012,42(7):244-249. |
| |
| Authors: | QIANG Hui-ying |
| |
| Affiliation: | QIANG Hui-ying (College of Mathematics,Physics and Software Engineering,Lanzhou Jiaotong University.Lanzhou 730070, China) |
| |
| Abstract: | Let G(V,E) be a simple graph,fc is a positive integer.A mapping / from V(G)∪E(G) to {1,2,…,k} is called the adjacen vertex-distinguishing VE-total coloring of G,if uv∈E(G),f(u)≠f(uv),f(v)≠f(uv),C(u)≠C(v),where C(u) = {f(u)}∪{f(uv)|uv∈E(G)}.The minimum number of fc for which G has a AVD-VE-TC with fc colors is called the adjacent vertex-distinguishing VE-total chromatic number of G.In this paper,the adjacent vertex-distinguishing VE-total chromatic number of Double Graph and Mycielski Graph of some special graphs is studied. |
| |
| Keywords: | the double graph the mycielski graph adjacent-vertex-distinguishing VE-total coloring adjacent-vertex-distinguishing VE-total chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
