| 一类3-正则图的邻强边染色 |
| |
| 引用本文： | 杨随义,王治文,何万生,文飞.一类3-正则图的邻强边染色[J].数学的实践与认识,2010,40(23). |
| |
| 作者姓名： | 杨随义 王治文 何万生 文飞 |
| |
| 基金项目： | 甘肃省自然科学基金，宁夏大学科学研究基金 |
| |
| 摘 要： | 对简单图G(V,E),f是从V(G)∪E(G)到{1,2,…,k}的映射,k是自然数,若f满足(1)uv,uw∈E(G),u≠w,f(uv)≠f(uw);(2)uv∈E(G),C(u)≠C(v).则称f是G的一个邻强边染色,最小的k称为邻强边色数,其中C(u)={f(uv)|uv∈E(G)}.给出了一类3-正则重圈图的邻强边色数.
|
| 关 键 词： | 3-正则图 邻强边染色 邻强边色数 |
Adjacent Strong Edge Coloring of a Kind of 3-Regular Graphs |
| |
| YANG Sui-yi,WANG Zhi-wen,HE Wan-sheng,WEN Fei.Adjacent Strong Edge Coloring of a Kind of 3-Regular Graphs[J].Mathematics in Practice and Theory,2010,40(23). |
| |
| Authors: | YANG Sui-yi WANG Zhi-wen HE Wan-sheng WEN Fei |
| |
| 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:(1)uv,uw∈E(G),v≠w,f(uv)≠f(uw);(2)uv∈E(G),C(u)≠C(v).we say that f is the adjacent strong edge coloring;ofG.The minimal number of k is called the adjacent strong edge chromatic number;ofG,whereC(u)= {f(uv)|uv∈E(G)}.In this paper,we discuss the adjacent strong;edge chromatic number of a kind of 3-regular repeated cycle graphs. |
| |
| Keywords: | 3-regular graph Adjacent strong edge coloring Adjacent strong edge chromatic number |
| 本文献已被 万方数据 等数据库收录！ |
|
