两类联图的边幻和全标号  

Edge-Magic Total Labelling of Two Kinds for Composite Graphs

作　　者：李敬文[1] 邵淑宏 袁清厚 张丽景 王笔美 Li Jingwen;Shao Shuhong;Yuan Qinghou;Zhang Lijing;Wang Bimei(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China;Lanzhou Petrochemical University of Vocational Technology,Lanzhou 730060,China)

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070 [2]兰州石化职业技术大学,甘肃兰州730060

出　　处：《南开大学学报（自然科学版）》2021年第6期68-74,共7页Acta Scientiarum Naturalium Universitatis Nankaiensis

基　　金：国家自然科学基金(11961041,62062049.11461038)。

摘　　要：设计了一种递归算法,得到了15个点内扇图与单圈图组成的联图的边幻和全标号通过结果分析,发现两类联图F_(n)↑C_(l)↑S_(m)和F_(n)↑C_(l)↓S_(m)均为EMTL图.进而总结若干定理并给出证明结合已有结果,猜想所有的联图皆为EMTL图.A recursive algorithm is designed to get all edge-magic total labelling of bicyclic graphs within 15 vertexs.Through the analysis of the results,it is found that the two kinds of composite graphs F_(n)↑C_(l)↑S_(m)andF_(n)↑C_(l)↓S_(m)are both Edge-magic graphs,and then some theorems are summarized and proved.Combined with the existing results,it is assumed that all bicyclic graphs are EMTL graphs.

关 键 词：联图 边幻和全标号 EMTL图 递归算法 

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