| 两类图的点可区别边染色数 |
| |
| 引用本文： | 唐保祥,任韩.两类图的点可区别边染色数[J].山西大学学报(自然科学版),2012,35(1):24-26. |
| |
| 作者姓名： | 唐保祥 任韩 |
| |
| 作者单位： | 1. 天水师范学院数学与统计学院,甘肃天水,741001
2. 华东师范大学数学系,上海,200062 |
| |
| 基金项目： | 国家自然科学基金(11171114);上海市自然科学基金(07XD14011);上海市重点学科建设基金(B407) |
| |
| 摘 要： | 证明了,任意正整数k≥2,存在点可区别边色数为2k+1的k+1-正则图；任意正整数m≥4,存在点可区别边色数为m的偶图.
|
| 关 键 词： | 正则图 偶图 点可区别边染色 点可区别边色数 |
Vertex-distinguishing Edge Chromatic Number of Two Kinds of Graphs |
| |
| TANG Bao-xiang
,
REN Han.Vertex-distinguishing Edge Chromatic Number of Two Kinds of Graphs[J].Journal of Shanxi University (Natural Science Edition),2012,35(1):24-26. |
| |
| Authors: | TANG Bao-xiang REN Han |
| |
| Institution: | 1.School of Mathematics and Statistics,Tianshui Normal University,Tianshui 741001,China; 2.Department of Mathematics,East China Normal University,Shanghai 200062,China) |
| |
| Abstract: | It was proved that for any integer k≥2,there was a k+1-regular graph with vertex-distinguishing edge chromatic number 2k+1,and for any integer m≥4,there was a bipartite graph with vertex-distinguishing edge chromatic number m. |
| |
| Keywords: | regular graph bipartite graph vertex-distinguishing edge coloring vertex-distinguish-ing edge chromatic number |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
