首页 | 本学科首页   官方微博 | 高级检索  
     

两类广义字典积S_n[h_n]的点可区别边染色
引用本文:焉秋瑶,田双亮,何 雪,赵晓翠. 两类广义字典积S_n[h_n]的点可区别边染色[J]. 鲁东大学学报, 2014, 0(2): 101-104
作者姓名:焉秋瑶  田双亮  何 雪  赵晓翠
作者单位:西北民族大学数学与计算机科学学院,兰州730030
基金项目:西北民族大学中央高校科研专项资金资助研究生项目(ycx13163,ycx13160)
摘    要:
研究了广义字典积G[h n]中G为n(n≥3)阶星Sn且与Sn最大度顶点对应的Hn-1分别为空图和完全图时的点可区别边染色.利用构造边染色的方法,得到了这两类广义字典积图的点可区别边色数.

关 键 词:广义字典积  点可区别边染色  点可区别边色数

Vertex-distinguishing Edge Coloring of Two Classes of the Generalized Lexicographic Product Sn[hn]
YAN Qiu-yao,TIAN Shuang-liang,HE Xue,ZHAO Xiao-cui. Vertex-distinguishing Edge Coloring of Two Classes of the Generalized Lexicographic Product Sn[hn][J]. Ludong University Journal (Natural Science Edition), 2014, 0(2): 101-104
Authors:YAN Qiu-yao  TIAN Shuang-liang  HE Xue  ZHAO Xiao-cui
Affiliation:(School of Mathematics and Computer Science, Northwest University for Nationalities, Lanzhou 730030, China)
Abstract:
The vertex-distinguishing edge coloring of the generalized lexicographic product G[h n ]is studied, when H n- 1 is an empty graph and a completed graph,where G is a star S n with n≥3 vertices and H n- 1 is the corresponding vertices of maximum degree. The vertex-distinguishing edge chromatic numbers of two classes of the generalized lexicographic product graphs are obtained by constructing edge-colorings.
Keywords:generalized lexicographic product  vertex-distinguishing edge coloring  vertex-distinguishing edge chromatic number
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号