吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

若干联图的邻点可区别I-全染色

张婷1, 朱恩强2, 刘晓娜3, 赵双柱3   

  1. 1. 兰州文理学院 师范学院, 兰州 730000; 2. 北京大学 信息科学技术学院, 北京 100871;3. 兰州文理学院 数字媒体学院, 兰州 730000
  • 收稿日期:2016-04-21 出版日期:2017-03-26 发布日期:2017-03-24
  • 通讯作者: 朱恩强 E-mail:zhuenqiang@pku.edu.cn

Adjacent VertexDistinguishing I-Total Coloringof Some Join Graphs

ZHANG Ting1, ZHU Enqiang2, LIU Xiaona3, ZHAO Shuangzhu3   

  1. 1. School of Normal, Lanzhou University of Arts and Science, Lanzhou 730000, China;2. School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China;3. School of Digital Media, Lanzhou University of Arts and Science, Lanzhou 730000, China
  • Received:2016-04-21 Online:2017-03-26 Published:2017-03-24
  • Contact: ZHU Enqiang E-mail:zhuenqiang@pku.edu.cn

摘要: 利用函数构造法和数学归纳法, 考虑图Pm∨Sn,Fm∨Wn和Wm∨Wn的邻点可区别I-全染色, 给出了它们邻点可区别I-全色数.

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

Abstract: By using the function construction method and mathematical induction, we considered adjacent vertexdistinguishing I-total coloring of graphs Pm∨Sn,Fm∨Wn and Wm∨Wn, and gave the adjacent vertexdistinguishing I-total chromatic number of them.

Key words: I-total coloring, adjacent vertexdistinguishing I-total chromatic number, adjacent vertexdistinguishing I-total coloring, join graph

中图分类号: 

  • O157.5