On the Spectral Radius of Cactuses with $n$ Vertices and Edge Independence Number $q$

Abstract

A graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we determine the graph with the
largest spectral radius among all connected cactuses with n vertices and edge independence number $q$.