圈平方图的强边染色  

Strong Edge Coloring of Cycle Square Graphs

作　　者：陆权烽 Lu Quanfeng(College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua,Zhejiang 321004)

机构地区：[1]浙江师范大学数理与信息工程学院

出　　处：《嘉兴学院学报》2019年第6期35-37,共3页Journal of Jiaxing University

基　　金：国家自然科学基金资助项目(11771402)

摘　　要：圈平方图是在一个圈的基础上连接距离为2的点之后得到的图.为了研究圈平方图的强边色数,将其视为一个哈密顿圈和内圈的并,依次对其进行强边染色,证明了圈平方图的强边色数小于等于14,推广了强边染色的相关结果.A cycle square graph is the graph obtained after connecting any two dots whose distance is two based on a cycle.In order to study the strong chromatic index of cycle square graphs,we consider it as the union of a Hamiltonian cycle and an inner cycle,and dye the strong edge chromatic number of cyclic square graphs in turn.We prove that the strong chromatic index of cycle square graphs is at most 14 and we generalize the relevant results.

关 键 词：强边色数 强边染色 圈平方图 

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