On the spectral radius of graphs without a star forest


Abstract in English

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.

Download