3 citations · 5 across the 10 of their papers we have counts for
10 papers
Random -removal algorithm
Fang Tian, Zi-Long Liu, Xiang-Feng Pan
One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. Th…
Bicyclic graphs with extremal degree resistance distance
Jia-Bao Liu, Si-Qi Zhangb, Xiang-Feng Pan +2
Let be the resistance distance between two vertices of a simple graph , which is the effective resistance between the vertices in the corresponding electrical ne…
Cacti with maximum Kirchhoff index
Wen-Rui Wang, Xiang-Feng Pan
The concept of resistance distance was first proposed by Klein and Randić. The Kirchhoff index of a graph is the sum of resistance distance between all pairs of vertice…
Maximizing Kirchhoff index of unicyclic graphs with fixed maximum degree
Dong Li, Xiang-Feng Pan, Jia-Bao Liu +1
The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. Its considerable applications are found in a varie…
The maximum degree resistance distance of cacti
Jia-Bao Liu, Xiang-Feng Pan
Various topological indices, based on the distances between the vertices of a graph, are widely used in theoretical chemistry. The degree resistance distance of a graph is defi…
Further results regarding the degree resistance distance of cacti
Jia-Bao Liu, Wen-Rui Wang, Yong-Ming Zhang +1
A graph is called a cactus if each block of is either an edge or a cycle. Denote by the set of connected cacti possessing vertices and cycles. In this p…