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

12 papers

math.PR2020

Exact mean first-passage time on generalized Vicsek fractal

Fei Ma, Xiaomin Wang, Ping Wang +1

Fractal phenomena may be widely observed in a great number of complex systems. In this paper, we revisit the well-known Vicsek fractal, and study some of its structural properties…

math.CO2020★ 2 cited

Ice-Flower Systems And Star-graphic Lattices

Bing Yao, Hongyu Wang, Xia Liu +4

Lattice theory has been believed to resist classical computers and quantum computers. Since there are connections between traditional lattices and graphic lattices, it is meaningfu…

cs.SI2020★ 20 cited

Counterexample: scale-free networked graphs with invariable diameter and density feature

Fei Ma, Xiaomin Wang, Ping Wang

Here, we propose a class of scale-free networks with some intriguing properties, which can not be simultaneously held by all the theoretical models with power-law degree d…

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…