几类联图的L(2,1)-边染色算法研究  

L(2,1)-edge coloring algorithm for several kinds of composite graphs

作　　者：朱利娜 李敬文[1] 孙帅 ZHU Lina;LI Jingwen;SUN Shuai(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,Gansu,China)

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070

出　　处：《山东大学学报（理学版）》2023年第8期63-72,共10页Journal of Shandong University(Natural Science)

基　　金：甘肃省科技计划项目(21ZD8RA008)。

摘　　要：本文针对随机图设计了一种L(2,1)-边染色算法,实验结果证明,该算法能够解决有限点内随机图的L(2,1)-边染色问题。通过分析实验结果发现了5类联图的染色特性,定义■分别来刻画这5类联图,并给出了相关定理及证明。An L(2,1)-edge coloring algorithm is designed to solve the L(2,1)-edge coloring for random graphs.By analyzing the experimental results,the coloring properties of five classes of join graphs are found,and Fn↑Sm、Cn↑Cm、F(2)n、C(n)3↑Sm and C(m)n are used to describe these graphs.The related theorems and proofs are given as well.

关 键 词：L(2 1)-边染色 色数 联图 算法 

分 类 号：O157.5[理学—数学]