20 citations · 70 across the 17 of their papers we have counts for
4 papers · 1 filter
Type-II Apollonian Model
Fei Ma, Jinzhi Ouyang, Ping Wang +2
The family of planar graphs is a particularly important family and models many real-world networks. In this paper, we propose a principled framework based on the widely-known Apoll…
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…
An ensemble of random graphs with identical degree distribution
Fei Ma, Xiaoming Wang, Ping Wang
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with whic…
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…