Maximizing the spectral radius of graphs of given size with forbidden a subgraph
Abstract
Let H7 denote the 7-vertex fan graph consisting of a 6-vertex path plus a vertex adjacent to each vertex of the path. Let K3 m-33K1 be the graph obtained by joining each vertex of a triangle K3 to m-33 isolated vertices. In this paper, we show that if G is an H7-free graph with size m≥ 33, then the spectral radius (G)≤ 1+m-2, equality holds if and only if G K3 m-33K1 (possibly, with some isolated vertices).
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.