若干字典积图的Mycielski图的点可区别边染色

J4 ›› 2012, Vol. 47 ›› Issue (8): 7-10.

若干字典积图的Mycielski图的点可区别边染色

田双亮

西北民族大学数学与计算机科学学院, 甘肃兰州 730030

收稿日期:2011-04-29 出版日期:2012-08-20 发布日期:2012-12-24
作者简介:田双亮(1965- ),男,硕士,教授,研究方向为图论及组合优化. Email: sl-tian@163.com
基金资助:
国家民委科研资助项目(10XB01);中央高校基本科研业务费专项资金项目(zyz2012089)

Vertex-distinguishing edge colorings of the Mycielski′s graphs of some lexicographic product graphs

TIAN Shuang-liang

College of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730030, Gansu, China

Received:2011-04-29 Online:2012-08-20 Published:2012-12-24

摘要/Abstract

摘要：

研究了一些特殊图的字典积的点可区别边染色, 如轮(或扇, 星)与完全图的字典积, 轮(或扇, 星)与完全二部图的字典积等。利用构造边染色的方法, 得到了这些字典积图的Mycielski图的点可区别边色数。

关键词: 字典积; Mycielski图; 点可区别边染色; 点可区别边色数

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.

Key words: lexicographic product; Mycielski′s graph; vertex-distinguishing edge coloring; vertex-distinguishing edge chromatic number

田双亮. 若干字典积图的Mycielski图的点可区别边染色[J]. J4, 2012, 47(8): 7-10.

TIAN Shuang-liang. Vertex-distinguishing edge colorings of the Mycielski′s graphs of some lexicographic product graphs[J]. J4, 2012, 47(8): 7-10.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed