路灯树型网络拓扑结构的边魔幻全标号算法  

An Edge-Magic Total Labeling Algorithm of Network Topology Structure of Street Lamp Trees

作　　者：谢建民 赵廷刚 洪文梅 XIE Jian-min;ZHAO Ting-gang;HONG Wen-mei(School of Information Engineering,Lanzhou City University,Lanzhou Gansu 730070;School of Early Childhood Teachers'Education,Lanzhou City University,Lanzhou Gansu 730020)

机构地区：[1]兰州城市学院信息工程学院,甘肃兰州730070 [2]兰州城市学院幼儿师范学院,甘肃兰州730020

出　　处：《甘肃高师学报》2022年第2期7-10,共4页Journal of Gansu Normal Colleges

基　　金：甘肃省高等学校创新能力提升项目“若干混合型网络拓扑结构魔幻性质研究及标号算法设计与实现”(2020B-236).

摘　　要：给出了路灯树型网络拓扑结构T(P_(m),S_(1,n),S_(2,n),…,S_(m,n))的定义,提出了该类网络拓扑结构的边魔幻全标号算法,证明了STREETLAMP_EMTL算法的正确性、时间复杂度及时间最优性,从而进一步得到了路灯树型网络拓扑结构T(P_(m),S_(1,n),S_(2,n),…,S_(m,n))的边魔幻性.The definition of street lamp trees network topology structure T(P_(m),S_(1,n),S_(2,n),…,S_(m,n))is given,and the edge-magic total labeling algorithm of network topology structure T(P_(m),S_(1,n),S_(2,n),…,S_(m,n))is given.Finally,We proved the correctness,time complexity and time optimality of STREETLAMP_EMTL algorithm,so got the edge-magic feature of network topology structure T(P_(m),S_(1,n),S_(2,n),…,S_(m,n)).

关 键 词：路灯树 网络拓扑结构 边魔幻全标号算法 时间复杂度 时间最优性 

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