The maximum spectral radius of ${\theta }_{2,2,3}$-free graphs with given size

Jing Gao, Xueliang Li

A theta graph ${\theta }_{r,p,q}$ is the graph obtained by connecting two distinct vertices with three internally disjoint paths of length $r,p,q$, where $q\ge p\ge r\ge 1$ and $p\ge 2$.…