The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth (Q640441)

The authors determine the graphs having maximal spectral radius of the signless Laplacian matrix \(Q=D+A\) in the sets of unicyclic and bicyclic graphs with fixed number of vertices and girth. In particular, for \(3\leq g\leq n-1\), the graph obtained from the cycle \(C_g\) by attaching \(n-g\) pendent edges to a vertex of \(C_g\) has the maximum signless Laplacian spectral radius among the unicyclic graphs on \(n\) vertices and girth \(g\). Next, for \(3\leq g\leq (n+1)/2\), the graph obtained from two disjoint copies of the cycle \(C_g\) by identifying a pair of vertices from each of the cycles and attaching \(n-2g+1\) pendent edges to a new vertex, has the maximum signless Laplacian spectral radius among the bicyclic graphs on \(n\) vertices and girth \(g\), having edge-disjoint cycles. On the other hand, among all bicyclic graphs with \(n\) vertices and girth \(g\), with \(3\leq g\leq 2(n+1)/3\), the maximum signless Laplacian spectral radius is attained by the graph consisting of three pairwise internal disjoint paths \(P_{1+\lfloor g/2\rfloor}\), \(P_{1+\lceil g/2\rceil}\) and \(P_{1+\lceil g/2\rceil}\) having common endpoints and \(n+1-\lceil 3g/2\rceil\) pendent edges attached to one of the paths' common endpoints.