Spectral extrema of graphs: Forbidden star-path forests

From MaRDI portal




Abstract: A path of order n is denoted by Pn, and a star of order n is denoted by Sn−1. A star-path forest is a forest whose connected components are paths and stars. In this paper we determine the maximum spectral radius of graphs that contain no copy of kSell−1cupPell, k1S2ell−1cupk2P2ell or kS4cup2P5 for n appropriately large.














This page was built for publication: Spectral extrema of graphs: Forbidden star-path forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6427367)