CORC  > 北京大学  > 信息科学技术学院
The Key-models And Their Lock-models For Designing New Labellings Of Networks
Wang, Hongyu ; Xu, Jin ; Yao, Bing
2016
关键词Security password topological structure graph labelling key-models lock-models tree odd-graceful labelling
英文摘要The security of real networks is facing serious challenges and is harder than ever. We propose an idea of "topological structure + number theory" for designing new passwords. By means of graph theory we define a twin odd-graceful tree T = T-1 circle T-2 obtained by identifying a certain vertex of T-1 with a certain vertex of T-2 together. We prove that some particular trees (key-models) can have their associated trees (lock-models) under the concept of twin odd-graceful trees. Trees having set-ordered odd-graceful labellings T-1 with their associated trees T-2 can produce certain twin odd-graceful trees such that these twin odd-graceful trees are odd-graceful.; National Natural Science Foundation of China [61309015, 61163054, 61363060]; CPCI-S(ISTP); 565-568
语种英语
出处IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)
内容类型其他
源URL[http://ir.pku.edu.cn/handle/20.500.11897/470107]  
专题信息科学技术学院
推荐引用方式
GB/T 7714
Wang, Hongyu,Xu, Jin,Yao, Bing. The Key-models And Their Lock-models For Designing New Labellings Of Networks. 2016-01-01.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace