连路树的全优美性  

Super Total Gracefulness on Path-linked Trees

作　　者：张明军 ZHANG Mingjun(School of Information Engineering, Lanzhou University of Finance and Economics,Lanzhou Gansu 730020, Chin)

机构地区：[1]兰州财经大学信息工程学院,甘肃兰州730020

出　　处：《长沙大学学报》2017年第2期1-4,共4页Journal of Changsha University

基　　金：国家自然科学基金(批准号:61662066;61363060)资助项目

摘　　要：图的标号理论是研究计算机网络节点的技术手段之一.给出了优美树、二分优美树、边对称树以及全优美标号的概念,定义了一类连路树T,并证明了连路树T及其边对称树是全优美标号、全优美图.为计算机网络的发展提供参考.The labeling theory of graphs is one of the technical means to study the nodes of computer networks. We present the concepts of trees including graceful tree, bipartite graceful tree, edge symmetric trees and super total graceful labelling. We define a class of path - linked tree T and prove that every path - linked tree T and its edge symmetric tree are super total graceful graph, so as to pro-vide a reference for the development of computer networks.

关 键 词：二分优美树 优美标号 全优美标号 边对称树 

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