2 citations · 4 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2019★ 1 cited
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…
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…
math.CO2019
A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications
Fei Ma, Ping Wang, Xudong Luo
Geodesic distance, sometimes called shortest path length, has proven useful in a great variety of applications, such as information retrieval on networks including treelike network…