paper

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

arXiv:2404.06843

Abstract

Let denote the -vertex \textit{fan graph} consisting of a -vertex path plus a vertex adjacent to each vertex of the path. Let be the graph obtained by joining each vertex of a triangle to isolated vertices. In this paper, we show that if is an -free graph with size , then the spectral radius equality holds if and only if (possibly, with some isolated vertices).

10 pages