暂无分享,去创建一个
Chao Yang | Xiaohui Zhang | Mingjun Zhang | Hui Sun | Xiaomin Wang | Hongyu Wang | Fei Ma | Sihua Yang | Jing Su | Yarong Mu | Bing Yao | Yirong Sun | B. Yao | Hui Sun | Xiaohui Zhang | Mingjun Zhang | Hongyu Wang | Chao Yang | Sihua Yang | Fei Ma | Xiaomin Wang | Jing Su | Yarong Mu | Yirong Sun
[1] B. Yao,et al. Strongly (k, d)-Graphical Labellings For Designing Graphical Passwords In Communication , 2017 .
[3] B. Yao,et al. Some results on spanning trees , 2010 .
[4] Construction of New Graphical Passwords with Graceful-Type Labellings on Trees , 2018, 2018 2nd IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference (IMCEC).
[5] B. Yao,et al. New Algebraic Groups Produced By Graphical Passwords Based On Colorings And Labellings , 2017 .
[6] César A. Hidalgo,et al. Scale-free networks , 2008, Scholarpedia.
[7] J. A. Bondy,et al. Graph Theory , 2008, Graduate Texts in Mathematics.
[8] Bing Yao,et al. A class of vertex–edge-growth small-world network models having scale-free, self-similar and hierarchical characters , 2018 .
[9] Bing Yao,et al. A family of small-world network models built by complete graph and iteration-function , 2018 .
[10] B. Yao,et al. The relations between network-operation and topological-property in a scale-free and small-world network with community structure , 2017 .
[11] Ying Zhu,et al. Graphical passwords: a survey , 2005, 21st Annual Computer Security Applications Conference (ACSAC'05).
[12] Jin Xu,et al. On Generalized Total Graceful Labellings of Graphs , 2018, Ars Comb..
[13] Xiuzhen Cheng,et al. Connected Dominating Set in Sensor Networks and MANETs , 2004 .
[14] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[15] Bing Yao,et al. Exploring New Cryptographical Construction of Complex Network Data , 2016, 2016 IEEE First International Conference on Data Science in Cyberspace (DSC).
[17] Chao Yang,et al. Topological Graphic Passwords And Their Matchings Towards Cryptography , 2018, ArXiv.
[18] Joseph A. Gallian,et al. A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.
[19] Bing Yao,et al. Twin Odd-graceful Trees Towards Information Security , 2017 .
[20] Xu Jin. Theory on Structure and Coloring of Maximal Planar Graphs (2) Domino Configurations and Extending-Contracting Operations , 2016 .
[21] Xiangqian Zhou,et al. Every lobster is odd-elegant , 2013, Inf. Process. Lett..
[22] Jin Xu. Theory on the Structure and Coloring of Maximal Planar Graphs (1)Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture , 2016, 1603.05130.
[23] Hui Sun,et al. Algebraic Groups for Construction of Topological Graphic Passwords in Cryptography , 2018, 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC).
[24] Haichang Gao,et al. A survey on the use of graphical passwords in security , 2013, J. Softw..
[25] Hui Sun,et al. On coloring/labelling graphical groups for creating new graphical passwords , 2017, 2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC).
[26] Bing Yao,et al. Connection Between Text-based Passwords and Topological Graphic Passwords , 2018, 2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC).
[27] Xiangqian Zhou,et al. A proof to the odd-gracefulness of all lobsters , 2012, Ars Comb..
[28] Fei Ma,et al. An iteration method for computing the total number of spanning trees and its applications in graph theory , 2018, Theor. Comput. Sci..
[29] Xu Jin. Theory on Structure and Coloring of Maximal Planar Graphs (4)σ -Operations and Kempe Equivalent Classes , 2016 .
[30] Bing Yao,et al. A Note on Strongly Graceful Trees , 2009, Ars Comb..
[31] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[32] Jin Xu,et al. The key-models and their lock-models for designing new labellings of networks , 2016, 2016 IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC).
[33] B. Yao,et al. CONNECTIONS BETWEEN LABELLINGS OF TREES , 2017 .
[34] Robert James Douglas,et al. NP-completeness and degree restricted spanning trees , 1992, Discret. Math..
[35] Hui Sun,et al. On Space and Design of Topological Graphic Passwords For Information Networks , 2018, 2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC).
[36] Fred R. McMorris,et al. Graphs with only caterpillars as spanning trees , 2003, Discret. Math..
[37] Henning Fernau,et al. An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..
[38] Chao Yang,et al. Spanning Trees And Dominating Sets In Scale-Free Networks , 2012 .
[39] Hui Sun,et al. Graph Theory Towards New Graphical Passwords In Information Networks , 2018, ArXiv.