Extensions on spectral extrema of \(C_5/C_6\)-free graphs with given size (Q6080541): Difference between revisions

The paper presents some significant findings involving the spectral extremas of graphs that have the forbidden subgraphs \(C_5\) and \(C_6\). This paper is an extension of a work by \textit{G. Min} et al. [Linear Algebra Appl. 640, 162--178 (2022; Zbl 1485.05104)]. Basically, the authors considered the Brualdi-Hoffman-Turán type problems of graphs proposed by \textit{V. Nikiforov} [ibid. 432, No. 9, 2243--2256 (2010; Zbl 1217.05152)]. Let \(\theta_{p,q,r}\) be a theta graph formed by connecting two distinct vertices with three independent paths of length \(p\), \(q\), and \(r\), respectively (length refers to the number of edges). In this paper, the authors first determine the unique maximal graph (without isolated vertices) of a given size and forbidding \(\theta_{1,2,3}\) and \(\theta_{1,2,4}\), respectively. Then they determine all the maximal \(C_5\)-free (respectively \(C_6\)-free) graphs (without isolated vertices) with the given size, excluding the book graph.