The spectral radius of minor free graphs

Abstract

In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the graphs which achieved the sharp bound are characterized. This result may be regarded to be an extended revision of the number of edges in an $n$-vertex graph without $F$-minor.

18 pages, 1 figurs