您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

山东大学学报(理学版) ›› 2017, Vol. 52 ›› Issue (4): 30-33.doi: 10.6040/j.issn.1671-9352.0.2016.242

• • 上一篇    下一篇

两条路的联图的点可区别I-全染色

陈祥恩1,苗婷婷1,王治文2   

  1. 1. 西北师范大学数学与统计学院, 甘肃 兰州 730070;2. 宁夏大学数学计算机科学学院, 宁夏 银川 750021
  • 收稿日期:2016-05-26 出版日期:2017-04-20 发布日期:2017-04-11
  • 作者简介:陈祥恩(1965— ), 男, 硕士,教授, 硕士研究生导师, 研究方向为图论及其应用. E-mail: chenxe@nwnu.edu.cn
  • 基金资助:
    国家自然科学基金资助项目(61163037,61163054,11261046);宁夏回族自治区百人计划资助项目

Vertex-distinguishing I-total colorings of the join of two paths

CHEN Xiang-en1, MIAO Ting-ting1, WANG Zhi-wen2   

  1. 1. School of Mathematics and statistics, Northwest Normal University, Lanzhou 730070, Gansu, China;
    2. School of Mathematics and Computer Sciences, Ningxia University, Yinchuan 750021, Ningxia, China
  • Received:2016-05-26 Online:2017-04-20 Published:2017-04-11

摘要: 利用构造具体染色的方法,讨论了两条路的联图的点可区别I-全染色和点可区别VI-全染色问题, 确定了这类图的点可区别I-全色数和点可区别VI-全色数, 同时说明了VDITC猜想和VDVITC猜想对于这类图是成立的。

关键词: I-全染色, 点可区别I-全色数, 点可区别I-全染色, 图的联

Abstract: The problems of vertex-distinguishing I-total colorings and vertex-distinguishing VI-total colorings of the join of two paths are discussed by using the method of constructing concrete coloring. Vertex-distinguishing I-total chromatic numbers and vertex-distinguishing VI-total chromatic numbers of Pm∨Pn are determined,and the VDITC conjecture and VDVITC conjecture are valid for Pm∨Pn.

Key words: vertex distinguishing I-total coloring, vertex distinguishing I-total chromatic number, the join of graphs, I-total coloring

中图分类号: 

  • O157.5
[1] BURRIS A C, SCHELP R H. Vertex-distinguish proper edge-colorings[J]. J Graph Theory, 1997, 26(2):73-82.
[2] BAZGAN C, HARKAT-BENHANDINE A, LI Hao, et al. On the vertex-distinguish proper edge-colorings of graphs[J]. J of Comb Theory: Series B, 1999, 75(2):288-301.
[3] HARARY F, PLANTHOLT M. The point-distinguishing chromatic index[M] // HARARY F, MAYBEE J S. Graphs and Application. New York: Wiley Interscience, 1985: 147-162.
[4] CHEN Xiangen. Point-distinguishing chromatic index of the union of paths[J]. Czechoslovak Mathematical Journal, 2014, 64(3):629-640.
[5] ZHANG Zhongfu, QIU Pengxiang, XU Baogen, et al. Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoria, 2008, 87:33-45.
[6] CHEN Xiangen, LI Zepeng. Vertex-distinguishing I-total colorings of graphs[J]. Utilitas Mathematica, 2014, 95:319-327.
[1] 程辉,王志勇. 图的邻点强可区别的EI-全染色[J]. J4, 2010, 45(6): 18-22.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!