完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色

详细信息    查看全文 | 推荐本文 |

英文篇名：General Vertex-Distinguishing Total Colorings of Complete Bipartite Graphs K_(2,n) and K_(3,n) 作者：陈祥恩 ; 苏丽 ; 王治文 英文作者：CHEN Xiang'en;SU Li;WANG Zhiwen;College of Mathematics and Statistics,Northwest Normal University;School of Mathematics and Statistics,Ningxia University; 关键词：完全二部图 ; 一般全染色 ; 一般点可区别全染色 ; 一般点可区别全色数 英文关键词：complete bipartite graphs;;general total coloring;;general vertex-distinguishing total coloring;;general vertex-distinguishing total chromatic number 中文刊名：JLDX 英文刊名：Journal of Jilin University(Science Edition) 机构：西北师范大学数学与统计学院;宁夏大学数学统计学院; 出版日期：2016-11-26 出版单位：吉林大学学报(理学版) 年：2016 期：v.54;No.222 基金：国家自然科学基金(批准号:61163037;61163054;11261046);; 宁夏回族自治区百人计划资助项目 语种：中文; 页：JLDX201606019 页数：5 CN：06 ISSN：22-1340/O 分类号：103-107

摘要

借助已有的完全二部图K_(2,n)和K_(3,n)的点可区别IE-全色数的结论,利用组合分析及构造具体染色的方法探讨完全二部图K_(2,n)和K_(3,n)的一般点可区别全染色问题,确定了K_(2,n)和K_(3,n)的一般点可区别全色数.
        With the help of existing conclusions of vertex distinguishing IE-total colorings of complete bipartite graphs K_(2,n) and K_(3,n),we discussed the question on general vertex-distinguishing total colorings of complete bipartite graphs K_(2,n)and K_(3,n)by using the method of combinatorial analysis and constructing the specific colorings,and determined the general vertex-distinguishing total chromatic numbers of K_(2,n)and K_(3,n).

引文

[1]Harary F,Plantholt M.The Point-Distinguishing Chromatic Index[M]//Harary F,Maybee J S.Graphs and Application.New York:Wiley,1985:147-162.
    [2]Horňak M,Sotak R.The Fifth Jump of the Point-Distinguishing Chromatic Index of Kn,n[J].Ars Combin,1996,42:233-242.
    [3]Horňak M,Sotak R.Localization of Jumps of the Point-Distinguishing Chromatic Index of Kn,n[J].Discuss Math Graph Theory,1997,17:243-251.
    [4]Horňak M,Salvi N Z.On the Point-Distinguishing Chromatic Index of Complete Bipartite Graphs[J].Ars Combin,2006,80:75-85.
    [5]CHEN Xiang’en.Point-Distinguishing Chromatic Index of the Union of Paths[J].Czechoslovak Math J,2014,64(3):620-640.
    [6]CHEN Xiang’en,GAO Yuping,YAO Bing.Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,n(m    [7]CHEN Xiang’en,HE Wenyu,LI Zepeng,et al.Vertex-Distinguishing IE-Total Colorings of Cycles and Wheels[J].Commun Math Res,2014,30(3):222-236.
    [8]LIU Chanjuan,ZHU Enqiang.General Vertex-Distinguishing Total Colorings of Graphs[J/OL].J Appl Math,2014-08-03.http://dx.doi.org/10.1155/2014/849748.