| 若干字典积图的Mycielski图的点可区别边染色 |
| |
| 引用本文： | 田双亮.若干字典积图的Mycielski图的点可区别边染色[J].山东大学学报(理学版),2012(8):7-10,15. |
| |
| 作者姓名： | 田双亮 |
| |
| 作者单位： | 西北民族大学数学与计算机科学学院 |
| |
| 基金项目： | 国家民委科研资助项目(10XB01);中央高校基本科研业务费专项资金项目(zyz2012089) |
| |
| 摘 要： | 研究了一些特殊图的字典积的点可区别边染色,如轮(或扇,星)与完全图的字典积,轮(或扇,星)与完全二部图的字典积等。利用构造边染色的方法,得到了这些字典积图的Mycielski图的点可区别边色数。
|
| 关 键 词： | 字典积 Mycielski图 点可区别边染色 点可区别边色数 |
Vertex-distinguishing edge colorings of the Mycielski′s graphs of some lexicographic product graphs |
| |
| TIAN Shuang-liang.Vertex-distinguishing edge colorings of the Mycielski′s graphs of some lexicographic product graphs[J].Journal of Shandong University,2012(8):7-10,15. |
| |
| Authors: | TIAN Shuang-liang |
| |
| Institution: | TIAN Shuang-liang(College of Mathematics and Computer Science,Northwest University for Nationalities,Lanzhou 730030,Gansu,China) |
| |
| Abstract: | The vertex-distinguishing edge colorings of the lexicographic product of some special graphs are studied,such as the lexicographic product of a wheel(or fan,star) and a complete graph,the lexicographic product of a wheel(or fan,star) and a complete bipartite graph etc.The vertex-distinguishing edge chromatic numbers of the Mycielski′s graphs of these lexicographic product graphs are obtained by constructing edge-colorings. |
| |
| Keywords: | lexicographic product Mycielski′s graph vertex-distinguishing edge coloring vertex-distinguishing edge chromatic number |
| 本文献已被 CNKI 等数据库收录！ |
