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).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
