activity
20152020
most citedCounterexample: scale-free networked graphs with invariable diameter and density feature

20 citations · 96 across the 12 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.SI2019★ 19 cited

Dense networks with scale-free feature

Fei Ma, Xiaomin Wang, Ping Wang +1

While previous works have shown that an overwhelming number of scale-free networks are sparse, there still exist some real-world networks including social networks, urban networks,…

math.CO2019★ 1 cited

Determining Geodesic Distance on Arbitrary-order Subdivision of Tree with Applications

Fei Ma, Xiaomin Wang, Ping Wang

The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geode…

cs.IT2019★ 17 cited

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…

cs.IT2019★ 10 cited

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…

physics.soc-ph2019★ 8 cited

Constructions and properties of a class of random scale-free networks

Xiaomin Wang, Fei Ma

Complex networks have abundant and extensive applications in real life. Recently, researchers have proposed a number of complex networks, in which some are deterministic and others…