Extremal Spectral Radius in Bicyclic and Bipartite Unicyclic Graphs
arXiv:2512.23209
Abstract
The ABS spectral radius of a graph G is defined as the largest eigenvalue of its matrix. Motivated by recent studies on this parameter, in this paper, we determine the bipartite unicyclic graphs that attain the largest spectral radius. Furthermore, we characterize the bicyclic graphs that attain the largest and the second largest spectral radii.