摘要
讨论了联图P_m∨F_n和S_m∨F_n的邻点可区别V-全染色问题,利用联图的结构特点和函数构造法,给出了它们的邻点可区别V-全染色,并在此基础上运用色调整技术得到了联图P_m∨W_n,S_m∨W_n,S_m∨S_n,F_m∨F_n的邻点可区别V-全色数.同时也验证了图的邻点可区别V-全染色猜想.
We discussed the adjacent vertex-distinguishing V-total coloring of join graphsPmV Fn and Sm∨Fn,and a new coloring method is given according to the structure features of join graphs and function construction method.On the basis of this,the adjacent vertex-distinguishing V-total chromatic numbers of join graphs Pm∨Wn,Sm∨Wn,Sm ∨Sn,and .Fm∨Fn are determined using color adjustment technology.Farthermore,the adjacent vertex V-total coloring conjecture is checked.'
作者
李永艳
LI Yong-yan(Department of Mathematics,Beijing Jiaotong University Haibin College,Huanghua 061199,China)
出处
《数学的实践与认识》
北大核心
2018年第23期129-135,共7页
Mathematics in Practice and Theory
基金
北京交通大学海滨学院重点科研项目(HBJY18004)
河北省高等教育教学改革研究与实践项目(2017GJJG364)
关键词
联图
邻点可区别V-全染色
邻点可区别V-全色数
join graph
adjacent vertex-distinguishing V-total coloring
adjacent vertexdistinguishing V-total chromatic number
