双圈图边幻和全标号  

Edge-magic total labelling of bicyclic graphs

作　　者：邵淑宏 李敬文 顾彦波 王笔美 SHAO Shuhong;LI Jingwen;GU Yanbo;WANG Bimei(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China;不详)

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

出　　处：《华中师范大学学报（自然科学版）》2020年第6期918-926,共9页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金项目(11461038).

摘　　要：图的边幻和全标号是指图G(p,q)中任意一条边与其关联顶点的标号之和等于常数,且点和边的所有标号值一一映射到集合1,2,…,p+q.该文针对双圈图,设计了一种边幻和标号判定算法,利用该算法可以得到15个点内的所有双圈图边幻和全标号.通过结果分析,找到了两类双圈图的标号规律,定义了新的图运算符号CnΔCl Sm和CnΔClΔSm来刻画这两类图,总结了若干定理并给出证明,进一步猜测当顶点数p≥16时,相关结论仍然成立.The edge-magic total labelling of a graph G(p,q)means that the sum of labellings of any edge and its incident vertice is equal to a constant,and the mapping of all labelling values of vertice and edges is the set 1,2,…,p+q.In this paper,a judge algorithm is designed to get all edge-magic total labelling of bicyclic graphs within 15 vertices.Through the analysis of the results,finding the rules of edge-magic total labelling for two kinds of bicyclic graphs,and defining the new graph operational symbols CnΔClSm and CnΔClΔSm to describe such graphs,several theorems are summarized and proved finally.It is further conjectured that the relevant conclusions are still valid when the vertex p≥16.

关 键 词：双圈图 边幻和图 边幻和标号 算法 

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