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).
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.
