图mn(Pt)的邻点可区别的I-均匀全染色
Incidence-Adjacent Vertex Distinguishing Equitable Total Coloring of mn(Pt)
张婷 1张修雪 1杜佳2
作者信息
- 1. 兰州文理学院教育学院,甘肃 兰州 730000
- 2. 兰州文理学院数字媒体学院,甘肃 兰州 730000
- 折叠
摘要
针对广义Mycielski图的结构特征,提出了基于色调整技术的局部均匀染色法,这种染色法能够将较大图的染色转化为较小图的染色,简化染色过程,提高染色效率.利用基于色调整技术的局部均匀染色法和函数构造法研究给出了第二类广义Mycielski图mn(Pt)的邻点可区别的I-均匀全染色,得到了其邻点可区别的I-均匀全色数,结果验证了这类图满足邻点可区别L均匀全染色猜想.
Abstract
According to the structural characteristics of generalized Mycielski graphs,a local equitable coloring method based on color adjustment technology is proposed.This method can transform the coloring of larger graphs into that of smaller graphs,simplify the coloring process and improve the coloring efficiency.In this paper,by using the local equitable coloring method based on the color adjustment technique and the function construction methods,we study and give the adjacent vertex distinguishing equitable total coloring of the second kind of general Mycielski graphs mn(Pt),obtained the chromatic numbers of them.The results verify that this kind of graphs satisfy the AVDETC conjecture.
关键词
第二类广义Mycielski图/基于色调整技术的局部均匀染色法/邻点可区别I-均匀全染色Key words
the second general Mycielski graph/a local equitable coloring method based on color adjustment technology/incidence-adjacent vertex distinguishing equitable total coloring引用本文复制引用
基金项目
2023年甘肃省高等学校人才培养质量提升项目()
甘肃省高等学校创新能力提升项目(2019B-195)
兰州文理学院校级科研项目(2020QNRC09)
出版年
2024
NETL
NSTL
万方数据