Edge-Magic Total Labellings of Some Network Models

摘要：

　　It has been known that edge-symmetric graphs can be used as models of some scale-free networks,such as hierarchial networks and self-similar networks,such as graph colorings can be used for distinguishing objects of communication and informa-tion networks.We study the edge-magic property of edge-symmetric graphs,and construct graphs having edge-magic total labellings from smaller graphs.

关键词： network tree set-ordered labellings edge-magic total labelling edge-symmetric graphs

作者: Hongyu WANG Bing YAO Chao YANG Sihua YANG Xiangen CHEN Ming Yao Zhenxue Zhao

作者单位: College of Mathematics and Statistics, Northwest Normal University, Lanzhou, 730070, China Department of Information Process and Control Engineering, Lanzhou Petrochemical College of Vocation

会议类型: 国际会议

会议名称: 2013 2nd International Symposium on Computer,Communication,Control and Automation(ISCCCA-13)(2013年第二届计算机、通信与自动化国际会议)

会议地点: 太原

会议语种:英文

页码: 491-494

在线出版日期: 2013-04-06（万方平台首次上网日期，不代表论文的发表时间）