基于含圈非连通图优美性的拓扑图密码  

Topological graph passwords based on the gracefulness of disconnected graphs with circles

作　　者：牟亚蓉 刘信生 姚兵 MU Yarong;LIU Xinsheng;YAO Bing(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]西北师范大学数学与统计学院

出　　处：《华东师范大学学报（自然科学版）》2020年第1期51-57,共7页Journal of East China Normal University(Natural Science)

基　　金：国家自然科学基金(61163054,61363060,61662066)

摘　　要：图的标号是图论的一个重要分支,从非连通图入手,证明了两类非连通图G=(C4,K r)∪∪kt=1 Ktm,n和G=(C4,K r)∪K1,n∪∪kt=1Tt都具有优美标号.且证明方法能够算法化,为非连通图应用于网络提供了可行的理论保证.Graph labeling is an important branch of graph theory.We use disconnected graphs to start our study,and show that disconnected graphs G=(C4,K r)∪∪kt=1 Ktm,n and G=(C4,K r)∪K1,n∪∪kt=1Tt allow graceful labelings.Algorithms can be used to provide a theoretical basis for proving the application of disconnected graphs to networks.

关 键 词：非连通图 完全二部图 优美标号 

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