兰州理工大学学报 ›› 2021, Vol. 47 ›› Issue (3): 170-172.

• 数理科学 • 上一篇    

若干Mycielski图的邻点扩展和可区别全染色

李永艳*, 杜静   

  1. 沧州交通学院 通识教育学院, 河北 黄骅 061199
  • 收稿日期:2019-11-06 出版日期:2021-06-28 发布日期:2021-07-19
  • 通讯作者: 李永艳(1982-),女,河北沧州人,硕士,副教授.Email:liyongyan0@163.com
  • 基金资助:
    沧州市社会科学发展研究课题(201971)

Neighbor expanded sum distinguishing total coloring of some Mycielski graphs

LI Yong-yan, DU Jing   

  1. General Education, Canzhou Jiaotong College, Huanghua 061199, China
  • Received:2019-11-06 Online:2021-06-28 Published:2021-07-19

摘要: 讨论了Mycielski图M(Pn)、M(Cn)、M(Sn)、M(Fn)、M(Wn)的邻点扩展和可区别全染色问题.根据图形的结构特点,采用函数构造法,得到了这几类图的邻点扩展和可区别全色数,同时证明NESD猜想对上述5种Mycielski图是成立的.

关键词: Mycielski图, 邻点扩展和可区别全染色, 邻点扩展和可区别全色数

Abstract: Discusses the neighbor expanded sum distinguishing total coloring of Mycielski graphs M(Pn)、M(Cn)、M(Sn)、M(Fn) and M(Wn). The neighbor expanded sum distinguishing total chromatic numbers of M(Pn)、M(Cn)、M(Sn)、M(Fn) and M(Wn) are obtained by function construction methods. At the same time, it is proved that NESD conjecture is valid for the above five kinds of Mycielski graphs.

Key words: Mycielski graph, neighbor expanded sum distinguishing total coloring, neighbor expanded sum distinguishing total chromatic number

中图分类号: