Spectral Radius of Graphs with Size Constraints: Resolving a Conjecture of Guiduli
Rui Li, Anyao Wang, Mingqing Zhai

TL;DR
This paper proves a conjecture about the maximum spectral radius of graphs with size constraints on subgraphs, characterizes extremal graphs, and introduces a new potential function to analyze their structure.
Contribution
It resolves Guiduli's conjecture by establishing an upper bound on spectral radius for graphs with hereditary size properties and characterizes the extremal graphs achieving this bound.
Findings
Spectral radius of graphs with size constraints is bounded by a specific function.
Extremal graphs are characterized as join graphs with particular forest structures.
Introduction of a novel potential function $ ext{eta}(F)$ for structural analysis.
Abstract
We resolve a problem posed by Guiduli (1996) on the spectral radius of graphs satisfying the Hereditarily Bounded Property , which requires that every subgraph with satisfies . For an -vertex graph satisfying , where and , we prove that the spectral radius is bounded above by , where , thus affirmatively answering Guiduli's conjecture. Furthermore, we present a complete characterization of the extremal graphs that achieve this bound. These graphs are constructed as the join graph , where is either or a forest consisting solely of star structures. The specific structure of such forests is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Graph theory and applications
