activity
20142020
most citedThe Laplacian polynomial of graphs derived from regular graphs and applications

3 citations · 5 across the 10 of their papers we have counts for

collaborators
Showing 2015Show all

6 papers · 1 filter

math.CO2015★ 1 cited

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…

math.CO2015

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…

math.CO2015

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…

math.CO2015

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…

math.CO2015

Resistance distances in corona and neighborhood corona graphs with Laplacian generalized inverse approach

Jia-Bao Liu, Xiang-Feng Pan, Fu-Tao Hu

Let and be two graphs on disjoint sets of and vertices, respectively. The corona of graphs and , denoted by , is the graph formed f…

math.CO2015

Asymptotic incidence energy and Laplacian-energy-like invariant of the Union Jack lattice

Jia-Bao Liua, Xiang-Feng Pan

The incidence energy of a graph , defined as the sum of the singular values of the incidence matrix of a graph , is a much studied quantity with well known…