arXiv Analytics

Sign in

arXiv:2102.10248 [math.CO]AbstractReferencesReviewsResources

On the spectral radius of graphs without a star forest

Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang

Published 2021-02-20Version 1

In this paper, we present two sharp upper bounds for the spectral radius of (bipartite) graphs with forbidden a star forest and characterize all extremal graphs. Moreover, the minimum least eigenvalue of the adjacency matrix of graph with forbidden a star forest and all extremal graphs for graphs are obtained.

Comments: 15 pages
Journal: Discrete Mathematics;2021
Categories: math.CO
Subjects: 05C50, 05C35
Related articles: Most relevant | Search more
arXiv:0903.5353 [math.CO] (Published 2009-03-31)
Spectral radius and Hamiltonicity of graphs
arXiv:1609.00835 [math.CO] (Published 2016-09-03)
On the $A_α$-spectra of trees
arXiv:1309.0217 [math.CO] (Published 2013-09-01, updated 2014-07-20)
Spectral radius and Hamiltonian properties of graphs