Abstract
The unique graphs with maximum spectral radius and signless Laplacian spectral radius are determined among trees, unicyclic graphs and bicyclic graphs respectively with fixed numbers of vertices and branch vertices (vertices of degree at least 3) using a unified approach.
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
