20 citations · 119 across the 28 of their papers we have counts for
12 papers · 1 filter
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,…
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…
Exact solutions for geodesic distance on treelike models with some constraints
Xudong Luo, Fei Ma, Wentao Xu
Geodesic distance, commonly called shortest path length, has proved useful in a great variety of disciplines. It has been playing a significant role in search engine at present and…
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…
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…