Maximizing the spectral radius of graphs of given size with forbidden a subgraph
Combinatorics
2024-04-11 v1
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).
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