2 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
Spectral radius and the -power of Hamilton cycles
Xinru Yan, Xiaocong He, Lihua Feng +1
Let be a graph of order and spectral radius be the largest eigenvalue of its adjacency matrix, denoted by . In this paper, we determine the unique graph with maximum…
Mixed graphs with cut vertices having exactly two positive eigenvalues
Xiaocong He, Lihua Feng
A mixed graph is obtained by orienting some edges of a simple graph. The positive inertia index of a mixed graph is defined as the number of positive eigenvalues of its Hermitian a…
The normalized Laplacian, degree-Kirchhoff index and spanning trees of graphs derived from the strong prism of linear polyomino chain
Xiaocong He
Let be a linear polyomino chain with squares. Let be the graph obtained by the strong prism of a linear polyomino chain with squares, i.e. the strong product…
On the largest and least eigenvalues of eccentricity matrix of trees
Xiaocong He
The eccentricity matrix of a graph is constructed from the distance matrix of by keeping only the largest distances for each row and each column. This matr…
On the maximum Zagreb indices of bipartite graphs with given connectivity
Xiaocong He, Xiaobo He
The first Zagreb index of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index of a graph is defined as the sum of the pr…