Applying Graph Set-Labellings Having Constraint Sets Towards New Graphical Passwords

摘要：

　　Motivated from the idea of graphical structure plus number theory,two new set-colorings subject to some constraint sets are defined: one is the strong set-coloring(F,F)with the edge set-labelling F induced by the vertex set-labelling F,and other one is the strongly total set-coloring.We show that every simple,connected(p,q)-graph G admits a strongly total set-labelling,and any tree having a super edge-magic total labelling admits a 2-uniform strongly total set-coloring.

关键词： Information network graphical password number theory graph labelling set-coloring

作者: Bing Yao Hui Sun Xiaohui Zhang Jingwen Li Bing Yao Meimei Zhao

作者单位: College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,CHINA School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou 730070,CHINA College of Science,Gansu Agricultural University,Lanzhou 730070,CHINA

会议类型: 国际会议

会议名称: 2017 IEEE 3rd Information Technology and Mechatronics Engineering Conference(ITOEC2017)(2017 IEEE 第3届信息技术与机电一体化工程国际学术会议)

会议地点: 重庆

会议语种:英文

页码: 155-158

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