20 citations · 101 across the 20 of their papers we have counts for
5 papers · 1 filter
An extremal problem: How small scale-free graph can be
Fei Ma, Ping Wang, Bing Yao
The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of…
Topological Coding and Topological Matrices Toward Network Overall Security
Bing Yao, Meimei Zhao, Xiaohui Zhang +9
A mathematical topology with matrix is a natural representation of a coding relational structure that is found in many fields of the world. Matrices are very important in computati…
Using Chinese Characters To Generate Text-Based Passwords For Information Security
Bing Yao, Yarong Mu, Yirong Sun +12
Graphical passwords (GPWs) are in many areas of the current world. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GP…
Handshake between Fibonacci series and pure preferential attachment mechanism on a graph-model
Fei Ma, Ding Wang, Ping Wang +1
In order to better understand dynamical functions on amounts of natural and man-made complex systems, lots of researchers from a wide range of disciplines, covering statistic physi…
Random walks on Fibonacci treelike models: emergence of power law
Fei Ma, Ping Wang, Bing Yao
In this paper, we propose a class of growth models, named Fibonacci trees , with respect to the intrinsic advantage of Fibonacci sequence . First, we turn out mode…