It is well-known that the Brualdi-Hoffman-Turán-type problem inquiries about the maximum spectral radius of an -free graph with edges. Let denote the theta graph, which is constructed by connecting two vertices with 3 internally disjoint paths of lengths 1, , and respectively. Let be the fan graph, that is, the join of a and a path . Let be the friendship graph, obtained by having triangles share a common vertex. In this paper, we utilize the -core method and spectral techniques to address some spectral extrema of graphs with a fixed number of edges. Firstly, we demonstrate that for and , if is -free, then . Equality holds if and only if . This validates a conjecture by Yu, Li, and Peng [Discrete Math. 348 (2025) 114391] and refines a recent result by Li, Zhai, and Shu [European J. Combin. 120 (2024) 103966]. Secondly, we show that for with , if is -free and has edges, then . Equality holds precisely when . This confirms a conjecture put forward by Li, Lu, and Peng [Discrete Math. 346(2023)113680]. Finally, we identify the -free graph with edges that possesses the largest spectral radius, where and . A further research problem is also proposed.

生成讲解博客的中文版本

生成AI智能校验的中文版本