Spectral extrema of graphs with fixed size: forbidden a fan graph, friendship graph or theta graph

Abstract

It is well-known that the Brualdi-Hoffman-Tur\'an-type problem inquiries about the maximum spectral radius \( λ(G) \) of an \( F \)-free graph \( G \) with \( m \) edges. Let \( θ1,p,q \) denote the theta graph, which is constructed by connecting two vertices with 3 internally disjoint paths of lengths 1, \( p \), and \( q \) respectively. Let \( Fk \) be the fan graph, that is, the join of a \( K1 \) and a path \( Pk - 1 \). Let \( Fk,3 \) be the friendship graph, obtained by having \( k \) triangles share a common vertex. In this paper, we utilize the \( k \)-core method and spectral techniques to address some spectral extrema of graphs with a fixed number of edges. Firstly, we demonstrate that for \( m ≥slant 94k6 + 6k5 + 46k4 + 56k3 + 196k2 \) and \( k ≥slant 3 \), if \( G \) is \( F2k + 2 \)-free, then \( λ(G) ≤slant k - 1 + 4m - k2 + 12 \). Equality holds if and only if \( G Kk (mk-k - 12)K1 \). 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 \( m ≥slant 94k6 + 6k5 + 46k4 + 56k3 + 196k2 \) with \( k ≥slant 3 \), if \( G \) is \( Fk,3 \)-free and has \( m \) edges, then \( λ(G) ≤slant k - 1 + 4m - k2 + 12 \). Equality holds precisely when \( G Kk (mk-k - 12)K1 \). This confirms a conjecture put forward by Li, Lu, and Peng [Discrete Math. 346(2023)113680]. Finally, we identify the \( θ1,p,q \)-free graph with \( m \) edges that possesses the largest spectral radius, where \( q ≥slant p ≥slant 3 \) and \( p + q ≥slant 2k + 1 \). A further research problem is also proposed.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…