The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges

Abstract

Listen

Translate article

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