P_2×P_n(n≡0(mod 4))的邻点可区别Ⅰ-均匀全染色

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

英文篇名：Incidence-adjacent vertex distinguishing equitable total coloring of P_2×P_n (n≡0(mod 4)) 作者：王继顺 英文作者：WANG Ji-shun;School of Mathematics and Information Engineering,Lianyungang Normal College; 关键词：笛卡儿积图 ; 邻点可区别Ⅰ-均匀全染色 ; 全色数 英文关键词：Cartesian product graph;;incidence-adjacent vertex distinguishing equitable total coloring;;total chromatic number 中文刊名：GLKX 英文刊名：Journal of Science of Teachers' College and University 机构：连云港师范高等专科学校数学与信息工程学院; 出版日期：2019-01-30 出版单位：高师理科学刊 年：2019 期：v.39 基金：江苏省高等教育科学研究“十三五”规划课题(16YB091);; 连云港师范高等专科学校校科研课题(LYGSZ17051) 语种：中文; 页：GLKX201901003 页数：3 CN：01 ISSN：23-1418/N 分类号：10-12

摘要

讨论笛卡儿积图P_2×P~n当n≡0(mod 4)时邻点可区别Ⅰ-均匀全染色问题,根据该类图的结构性质,通过构造法给出它们的邻点可区别Ⅰ-均匀全染色方法,从而有效地确定了其邻点可区别Ⅰ-均匀全色数为4.
        The incidence-adjacent vertex distinguishing equitable total coloring of Cartesian product graphs P_2×P_n( n ≡0(mod 4))are discussed.By means of the construction method,the incidence-adjacent vertex distinguishing equitable total coloring of P_2×P_n are obtained, which determined effectively that the incidence-adjacent vertex distinguishing equitable total chromatic numbers of P_2×P_n are 4 according to the structural properties of this kind of graphs.

引文

[1]Zhang Zhong-fu,Chen Xian-gen,Li Jing-wen,et al.On adjacent-vertex-distinguishing total coloring of graphs[J].Science China Series A:Mathematics,2005,48(3):289-299
    [2]Zhang Zhong-fu,Qiu Peng-xiang,Xu Bao-gen,et al.Vertex-distinguishing total coloring of graphs[J].Ars Combinatoria,2008,87:33-45
    [3]Zhang Zhong-fu,Douglas R Woodal,Yao Bing,et al.Incidence adjacent vertex-distinguishing total coloring of graphs[EB/OL].(2008-06-12)[2008-07-24].http://202.201.18. 40:8080/mas5
    [4]王继顺,李步军.图的邻点可区别I-均匀全染色[J].应用数学学报,2015,38(1):125-136
    [5]杨随义,杨晓亚,何万生.冠图m nC×F,m nC×S与m nC×W的邻点可区别I-全染色[J].兰州理工大学学报,2011,37(6):154-156
    [6]王继顺.蛛网图及渔网图的邻点可区别I-全染色[J].数学的实践与认识,2017,47(7):152-160
    [7]王继顺.mP∨nF及mP∨nW的邻点可区别I-全染色[J].兰州理工大学学报,2014,40(4):159-162
    [8]刘秀丽.路、扇及星的Mycielski图的邻点可区别I全染色[J].中北大学学报:自然科学版,2015,36(4):408-411
    [9]王笑妍,刘焕平.几类图的均匀邻点可区别I-全染色[J].哈尔滨师范大学自然科学学报,2016,32(1):37-40
    [10]Bondy J A,Murty U S R.Graph Theory[M].New York:Springer,2008
    [11]陈科全,郭大立.若干直积图的邻点可区别I-全色数[J].洛阳理工学院学报:自然科学版,2013,23(1):70-74,96