J4 ›› 2009, Vol. 47 ›› Issue (6): 1160-1164.

• 数学 • 上一篇    下一篇

若干倍图的邻点可区别均匀全染色

马刚1, 张忠辅2   

  1. 1. 西北民族大学 计算机科学与信息工程学院, 兰州 730124|2. 兰州交通大学 应用数学研究所, 兰州 730070
  • 收稿日期:2009-04-10 出版日期:2009-11-26 发布日期:2010-01-07
  • 通讯作者: 马刚 E-mail:jsmg@xbmu.edu.cn.

On Adjacent VertexdistinguishingequitableTotal Coloring of Double Graphs

MA Gang1, ZHANG Zhongfu2   

  1. 1. College of Computer and Information Engineering, Northwest University for Nationalities, Lanzhou 730124, China;2. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
  • Received:2009-04-10 Online:2009-11-26 Published:2010-01-07
  • Contact: MA Gang E-mail:jsmg@xbmu.edu.cn.

摘要:

研究一些倍图的邻点可区别均匀全染色(AVDETC), 利用构造法和匹配法给出了偶阶完全图、 偶阶圈、 路、 星和轮的倍图的邻点可区别均匀全色数, 并验证了它们满足邻点可区别均匀全染色猜想(AVDETCC).

关键词: 倍图, 邻点可区别均匀全染色, 邻点可区别均匀全色数

Abstract:

We studied adjacent vertexdistinguishingequitable total coloring (AVDETC) of some double graphs, and developed the adjacent vertexdistinguishingequitable total chromatic numbers of double graphs of even order complete graph, even order cycle, path, star and wheel  using constructive method and matching method, which satisfies the conjecture on AVDETCC.

Key words: double graph, adjacent vertexdistinguishingequitable total coloring, adjacent vertexdistinguishingequitable total chromatic number

中图分类号: 

  • O157.5