10 citations · 16 across the 9 of their papers we have counts for
6 papers · 1 filter
On the existence of neutral graph
Fei Ma
Graph is considered neutral if its assortativity coefficient is equal to zero. In this paper, we address an outstanding conjecture, i.e., whether is there a neutral graph on $n…
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…
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…
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…