2000 character limit reached
Maximizing the spectral radius of graphs of given size with forbidden a subgraph
Published 10 Apr 2024 in math.CO | (2404.06843v1)
Abstract: Let $H_7$ denote the $7$-vertex \textit{fan graph} consisting of a $6$-vertex path plus a vertex adjacent to each vertex of the path. Let $K_3 \vee \frac{m-3}{3}K_1$ be the graph obtained by joining each vertex of a triangle $K_3$ to $\frac{m-3}{3}$ isolated vertices. In this paper, we show that if $G$ is an $H_{7}$-free graph with size $m\geq 33$, then the spectral radius $ \rho(G)\leq 1+\sqrt{m-2},$ equality holds if and only if $G\cong K_3 \vee \frac{m-3}{3}K_1$ (possibly, with some isolated vertices).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.