您的位置：山东大学 -> 科技期刊社 -> 《山东大学学报（理学版）》

山东大学学报（理学版） ›› 2018, Vol. 53 ›› Issue (8): 53-60.doi: 10.6040/j.issn.1671-9352.0.2017.240

• • 上一篇    下一篇

K1,3,p和 K1,4,p的点可区别的IE-全染色及一般全染色

寇艳芳1,陈祥恩1,王治文2   

  1. 1.西北师范大学数学与统计学院, 甘肃 兰州 730070;2.宁夏大学 数学统计学院, 宁夏 银川 750021
  • 收稿日期:2017-05-18 出版日期:2018-08-20 发布日期:2018-07-11
  • 作者简介:寇艳芳(1988— ), 女, 硕士研究生, 研究方向为图论及其应用. E-mail:1637191507@qq.com
  • 基金资助:
    国家自然科学基金资助项目(11761064,61163037,11261046);宁夏回族自治区百人计划资助项目

Vertex-distinguishing IE-total coloring and general-total coloring of K1,3,p and K1,4,p

  1. 1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Gansu, China;
    2. School of Mathematics and Statistics, Ningxia University, Yinchuan 750021, Ningxia, China
  • Received:2017-05-18 Online:2018-08-20 Published:2018-07-11

PDF (PC)

428

摘要： 利用色集事先分配法,构造染色法,反证法探讨了完全三部图K1,3,p和K1,4,p 的点可区别IE-全染色和点可区别一般全染色问题,确定了K1,3,p和K1,4,p的点可区别IE-全色数和点可区别一般全色数。

关键词: 完全三部图, IE-全染色, 一般全染色, 点可区别一般全染色, 点可区别IE-全染色

Abstract: The vertex-distinguishing IE-total coloring and vertex-distinguishing general total coloring of complete tripartite graphs K1,3,p and K1,4,pare discussed by distributing the color sets in advance,constructing the colorings and proving by contradiction. The vertex-distinguishing IE-total chromatic number and vertex-distinguishing general total chromatic number of K1,3,p and K1,4,p have been determined.

Key words: general total coloring, vertex-distinguishing general total coloring, IE-total coloring, complete tripartite graphs, vertex-distinguishing IE-total coloring

中图分类号: 

  • O157.5
[1] HARARY F, PLANTHOLT M. “Conditional colorability in graphs,” in graphs and applications[M]. New York: John Wiley & Sons,1985.
[2] HORNAK M, SOTAK R. The fifth jump of the point-distinguishing chromatic index of Kn,n[J]. Ars Combinatoria, 1996, 42:233-242.
[3] HORNAK M, SOTAK R. Localization jumps of the point-distinguishing chromatic index of Kn,n[J]. Discuss Math Graph Theory, 1997, 17:243-251.
[4] HORNAK M, ZAGAGLIA-SALVI N. On the point-distinguishing chromatic index of Km,n[J]. Ars Combinatoria, 2006, 80:75-85.
[5] ZAGAGLIA-SALVI N. On the value of the point-distinguishing chromatic index of Kn,n[J]. Ars Combinatoria, 1990, 29B:235-244.
[6] CHEN Xiangen. Point-distinguishing chromatic index of the union of paths[J]. Czechoslovak Mathematical Journal, 2014, 64(3):629-640.
[7] CHEN Xiangen, GAO Yuping, YAO Bing. Vertex-distinguishing IE-total colorings of complete bipartite graphs Km,n(m[J]. Discussiones Mathematicae Graph Theory, 2013, 33:289-306.
[8] LIU C, ZHU E. General Vertex-distinguishing total coloring of graphs[J]. Journal of Applied Mathematics, 2014, Article ID 849748, 7 pages.
[1] 王国兴. 点不交的m个C3的并的点可区别IE-全染色[J]. J4, 2011, 46(2): 57-61.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
版权所有 © 2018 《山东大学学报(理学版)》编辑部　
地址: 山东省济南市山大南路27号山东大学中心校区（250100）　电话: +86-0531-88366917　E-mail: xblxb@sdu.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发