English

Maximizing the spectral radius of graphs of given size with forbidden a subgraph

Combinatorics 2024-04-11 v1

Abstract

Let H7H_7 denote the 77-vertex \textit{fan graph} consisting of a 66-vertex path plus a vertex adjacent to each vertex of the path. Let K3m33K1K_3 \vee \frac{m-3}{3}K_1 be the graph obtained by joining each vertex of a triangle K3K_3 to m33\frac{m-3}{3} isolated vertices. In this paper, we show that if GG is an H7H_{7}-free graph with size m33m\geq 33, then the spectral radius ρ(G)1+m2, \rho(G)\leq 1+\sqrt{m-2}, equality holds if and only if GK3m33K1G\cong K_3 \vee \frac{m-3}{3}K_1 (possibly, with some isolated vertices).

Keywords

Cite

@article{arxiv.2404.06843,
  title  = {Maximizing the spectral radius of graphs of given size with forbidden a subgraph},
  author = {Yanting Zhang and Ligong Wang},
  journal= {arXiv preprint arXiv:2404.06843},
  year   = {2024}
}

Comments

10 pages