| 图M(P_m)和M(C_m)的点可区别边色数 |
| |
| 引用本文： | 王继顺.图M(P_m)和M(C_m)的点可区别边色数[J].数学杂志,2012,32(2):363-368. |
| |
| 作者姓名： | 王继顺 |
| |
| 作者单位： | 连云港师范高等专科学校数学与应用数学系;江苏连云港222006兰州交通大学应用数学研究所,甘肃兰州730070 |
| |
| 基金项目： | 国家自然科学基金，连云港师范高等专科学校"青蓝"工程人才基金 |
| |
| 摘 要： | 本文研究了圈Cm和路Pm的Mycielski图的点可区别边染色问题.利用构造法给出了M(Cm)图的点可区别边染色法,得到了它的点可区别边色数,进而从图的结构关系,有效获得了M(Pm)图的相应点可区别边染色法和其边色数.该方法对研究存在结构关系的图染色问题具有重要的借鉴意义.
|
| 关 键 词： | Mycielski图 点可区别边染色 点可区别边色数 构造法 |
VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF M(Pm) AND M(Cm) |
| |
| WANG Ji-shun.VERTEX-DISTINGUISHING EDGE CHROMATIC NUMBER OF M(Pm) AND M(Cm)[J].Journal of Mathematics,2012,32(2):363-368. |
| |
| Authors: | WANG Ji-shun |
| |
| Institution: | WANG Ji-shun(Department of Mathematics and Applied Mathematics,Lianyungang Teacher’s College,Lianyungang 222006,China)(Institute of Applied Math.,Lanzhou Jiaotong University,Lanzhou 730070,China) |
| |
| Abstract: | In this paper,we discuss the problem of the vertex-distinguishing edge-coloring on M(Cm) and M(Pm).We present the vertex-distinguishing edge-coloring on M(Cm) and obtain the vertex-distinguishing edge chromatic number of M(Cm) by using constructive method.Moreover,we derive the vertex-distinguishing edge-coloring and the vertex-distinguishing edge chromatic number of M(Pm) efficiently and correspondingly by means of the structural relations between M(Pm) and M(Cm).This method of the research provides an important reference for us to study the coloring problem of graphs with structural relations. |
| |
| Keywords: | Mycielski’s graph vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number constructive method |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
