| 扇的倍图的邻点可区别边色数 |
| |
| 引用本文： | 田京京,杨立夫,王树勋,张忠辅. 扇的倍图的邻点可区别边色数[J]. 数学的实践与认识, 2008, 38(15) |
| |
| 作者姓名： | 田京京 杨立夫 王树勋 张忠辅 |
| |
| 作者单位： | 1. 陕西理工学院,数学系,汉中,723000
2. 兰州交通大学,应用数学研究所,兰州730070 |
| |
| 基金项目： | 国家自然科学基金，陕西省教育厅资助项目 |
| |
| 摘 要： | 设G(V,E)是阶数至少是3的简单连通图,若f是图G的k-正常边染色,使得对任意的uv∈E(G),C(u)≠C(v),那么称f是图G的k-邻点可区别边染色(k-ASEC),其中C(u)={f(uw)│uw∈E(G)},而χa′s(G)=min{k│存在G的一个k-ASEC},称为G的邻点可区别边色数.本文给出扇的倍图D(Fm)的邻点可区别边色数.
|
| 关 键 词： | 图 倍图 扇 邻点可区别边色数 |
The Chromatic Number of Adjacent-strong Edge Coloring of the Double Graph D(Fm) |
| |
| TIAN Jing-jing,YANG Li-fu,WANG Shu-xun,ZHANG Zhong-fu. The Chromatic Number of Adjacent-strong Edge Coloring of the Double Graph D(Fm)[J]. Mathematics in Practice and Theory, 2008, 38(15) |
| |
| Authors: | TIAN Jing-jing YANG Li-fu WANG Shu-xun ZHANG Zhong-fu |
| |
| Abstract: | Let G=(V,E)be a normal simple connected graph of order ≥3.A k-normal edge-coloring f for G is called a k-adjacent strong edge-coloring(shortly,k-ASEC)for G if any two adjacent vertices are incident to different sets of colored edges.The minimum of all positive integers k such that there is a k-ASEC for G is said to be the chromatic number of adjacent strong edge coloring of G and denoted by χ'as(G).In this paper,we compute the chromatic number of adjacent strong edge coloring of the double graph D(Fm). |
| |
| Keywords: | Graph double graph fan chromatic number of adjacent strong edge coloring |
| 本文献已被 万方数据 等数据库收录！ |
|
