2 citations · 4 across the 4 of their papers we have counts for
7 papers
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…
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…
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…
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…
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…