J
Jinlong Shu
Researcher at East China Normal University
Publications - 73
Citations - 1120
Jinlong Shu is an academic researcher from East China Normal University. The author has contributed to research in topics: Spectral radius & Adjacency matrix. The author has an hindex of 17, co-authored 72 publications receiving 907 citations. Previous affiliations of Jinlong Shu include University of Paris.
Papers
More filters
Journal ArticleDOI
A Sharp Upper Bound of the Spectral Radius of Graphs
Yuan Hong,Jinlong Shu,Kunfu Fang +2 more
TL;DR: The following sharp upper bound is obtained of the minimum degree of vertices of G, which is either a regular graph or a bidegreed graph in which each vertex is of degree either ? or n?1.
Journal ArticleDOI
On the distance spectrum of graphs
TL;DR: In this article, it was shown that the complete k-partite graph is determined by its D -spectrum, and that all connected graphs of diameter 2 have at least three D -eigenvalues when λ 1 (D ) is not an integer.
Journal ArticleDOI
A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
TL;DR: In this paper, the largest eigenvalue of the Laplacian matrix of a simple connected graph with n vertices is denoted by μ(G) and the equality holds if and only if G is a regular bipartite graph.
Journal ArticleDOI
On the Aα-spectral radius of a graph
TL;DR: In this article, three edge graft transformations on the A α -spectral radius of a graph have been proposed to determine the unique graph with the maximum A α-Spectral radius among all connected graphs with diameter d.
Journal ArticleDOI
Sharp upper bounds on the spectral radius of graphs
Jinlong Shu,Yarong Wu +1 more
TL;DR: In this paper, the spectral radius of a simple connected graph with n vertices, m edges and degree sequence was shown to be upper bounded in terms of the degree sequence of the graph.