20 citations · 119 across the 28 of their papers we have counts for
6 papers · 1 filter
Random walks on stochastic uniform growth trees: Analytical formula for mean first-passage time
Fei Ma, Ping Wang
As known, the commonly-utilized ways to determine mean first-passage time for random walk on networks are mainly based on Laplacian spectra. However, metho…
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…
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…
Structural properties and average tapping time on scale-free graphs with smallest diameter
Fei Ma, Ping Wang
In this paper, we propose a class of graphs and first study some structural properties, such as, average degree, on them. The results show that (1) graphs $G^{\sta…
Trapping problem on star-type graphs with applications
Fei Ma, Ping Wang
The trapping problem on graph (or network) as a typical focus of great interest has attracted more attention from various science fields, including applied mathematics and theoreti…
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…