Abstract
A graph is said to be H-minor free if it does not contain H as a minor. In spectral extremal graph theory, it is interesting to determine the maximum (signless Laplacian) spectral radius of graphs that do not contain a given H as a minor. In this paper, we characterize the unique extremal graph with the maximum signless Laplacian spectral radius among all n-vertex connected K1,t-minor free graphs (t≥3).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
