Abstract
Let $$\fancyscript{B}(n,r)$$B(n,r) be the set of all bicyclic graphs with $$n$$n vertices and $$r$$r cut edges. In this paper we determine the unique graph with maximal adjacency spectral radius or signless Laplacian spectral radius among all graphs in $$\fancyscript{B}(n,r)$$B(n,r).
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
