• 대한수학회지
• /
• 제60권5호
• /
• pp.959-986
• /
• 2023

Zhai and Lin recently proved that if G is an n-vertex connected 𝜃(1, 2, r + 1)-free graph, then for odd r and n ⩾ 10r, or for even r and n ⩾ 7r, one has ${\rho}(G){\leq}{\sqrt{{\lfloor}{\frac{n^2}{4}}{\rfloor}}}$, and equality holds if and only if G is $K_{{\lceil}{\frac{n}{2}}{\rceil},{\lfloor}{\frac{n}{2}}{\rfloor}}$. In this paper, for large enough n, we prove a sharp upper bound for the spectral radius in an n-vertex H-free non-bipartite graph, where H is 𝜃(1, 2, 3) or 𝜃(1, 2, 4), and we characterize all the extremal graphs. Furthermore, for n ⩾ 137, we determine the maximum number of edges in an n-vertex 𝜃(1, 2, 4)-free non-bipartite graph and characterize the unique extremal graph.