若干联图的邻点和可约边染色  

Adjacent points sum reducible edge coloring of some joint graphs

作　　者：罗榕 李敬文[1] 张树成 张荞君 LUO Rong;LI Jingwen;ZHANG Shucheng;ZHANG Qiaojun(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)

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

出　　处：《华中师范大学学报（自然科学版）》2023年第2期201-207,共7页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金项目(11961041,62062049,11461038)。

摘　　要：该文在已有的图染色概念基础之上,结合实际问题提出了邻点和可约边染色的新概念,设计了一种新型的邻点和可约边染色(adjacent vertex sum reducible edge coloring, AVSREC)算法,该算法采用迭代寻优方式针对有限点内的所有非同构图集进行求解,通过实验结果分析,总结得到了若干联图的定理并给出证明.Based on the existing graph coloring concepts and combined with practical problems,in this paper,the new concepts of adjacent point sum reducible edge coloring are put forward,and a new adjacent vertex sum reducible edge coloring algorithm is designed.The algorithm uses iterative optimization to solve all non isomorphic graph sets in finite points.Through the analysis of experimental results,some theorems of joint graphs are summarized and proved.

关 键 词：联图 邻点和可约边染色 邻点和可约边色数 算法 

分 类 号：TP301.5[自动化与计算机技术—计算机系统结构]