The spectral radius of graphs with no intersecting odd cycles (Q2142645)

Let \(G\) be a simple graph. Denote the number of vertices and edges by \(|G|\) and \(|E(G)|\). The Turán number of a graph \(F\) of order \(n\) is denoted and defined by \(\mathrm{ex}(n,F):= \max\{|E(G)| : |G| = n, F \not\subset G \}\), where \(F \not\subset G\) denotes that \(G\) does not contain an isomorphic copy of \(F\) as a subgraph. The set of all extremal graphs on \(n\) vertices for \(F\) is denoted and defined by \[ \mathrm{Ex}(n,F):= \{G : |G| = n, |E(G)|=\mathrm{ex}(n,F), F \not\subset G \}. \] Let \(\lambda(G)\) be the largest eigenvalue of the adjacency matrix of \(G\). Analogously, define \(\mathrm{ex}_{sp}(n,F):= \max\{\lambda(G) : |G| = n, F \not\subset G \}\) and \[ \mathrm{Ex}_{sp}(n,F):= \{G : |G| = n, \lambda(G) = \mathrm{ex}_{sp}(n,F), F \not\subset G \}. \] Let \(H_{s,t_1,\dots,t_k}\) be the graph consisting of \(s\geq 0\) triangles and \(k\geq1\) odd cycles of lengths \(t_1,\dots,t_k\) which intersect in exactly one common vertex. In this paper, the authors prove that \[ \mathrm{Ex}_{sp}(n,H_{s,t_1,\dots,t_k}) \subset \mathrm{Ex}(n,H_{s,t_1,\dots,t_k}), \] for sufficiently large \(n\).