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

Abstract

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$. A graph is ${\theta }_{r,p,q}$-free if it does not contain ${\theta }_{r,p,q}$ as a subgraph. The maximum spectral radius of ${\theta }_{1,p,q}$-free graphs with given size has been determined for any $q\ge p\ge 2$. Zhai, Lin and Shu [Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs, European J. Combin. 95 (2021) 103322] characterized the extremal graph with the maximum spectral radius of ${\theta }_{2,2,2}$-free graphs having $m$ edges. In this paper, we consider the maximum spectral radius of ${\theta }_{2,2,3}$-free graphs with size $m$ and characterize the extremal graph.

15 Pages