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

Yanting Zhang, Ligong Wang

Research output: Contribution to journalArticlepeer-review

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 [Formula presented] be the graph obtained by joining each vertex of a triangle K3 to [Formula presented] 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 [Formula presented] (possibly, with some isolated vertices).

Original languageEnglish
Pages (from-to)10-23
Number of pages14
JournalLinear Algebra and Its Applications
Volume727
DOIs
StatePublished - 15 Dec 2025

Keywords

  • Extremal graph
  • Fan graph
  • Size
  • Spectral radius

Fingerprint

Dive into the research topics of 'Maximizing the spectral radius of graphs of given size with a forbidden subgraph'. Together they form a unique fingerprint.

Cite this