Spectral Extremal Results on Trees

Let spex(n, F) be the maximum spectral radius over all F-free graphs of order n, and SPEX(n, F) be the family of F-free graphs of order n with spectral radius equal to spex(n, F). Given integers n, k, p with n > k > 0 and 0 <= p <= (sic)(n-k)/2(sic), let S-n,k(p) be the graph obtained from K-k del(n - k)K-1 by embedding p independent edges within its independent set, where 'del' means the join product. For n >= l >= 4, let G(n,l) = S-n,(l-2)/2(0) if l is even, and G(n,l) = S-n,S-(l-3)/2 (1) if l is odd. Cioaba, Desai and Tait [SIAM J. Discrete Math. 37 (3) (2023) 2228-2239] showed that for & ell; >= 6 and sufficiently large n, if rho(G) >= rho(G(n,l)), then G contains all trees of order pound unless G = G(n,l). They further posed a problem to study spex(n, F) for various specific trees F. Fix a tree F of order l >= 6, let A and B be two partite sets of F with |A| <= |B|, and set q = |A| - 1. We first show that any graph in SPEX(n, F) contains a spanning subgraph K-q,K-n-q for q >= 1 and sufficiently large n. Consequently, rho(K-q,K-n-q) <= spex(n, F) <= rho(G(n,l)), we further respectively characterize all trees F with these two equalities holding. Secondly, we characterize the spectral extremal graphs for some specific trees and provide asymptotic spectral extremal values of the remaining trees. In particular, we characterize the spectral extremal graphs for all spiders, surprisingly, the extremal graphs are not always the spanning subgraph of G(n,l).