Fat Hoffman graphs with smallest eigenvalue greater than -3
Akihiro Munemasa, Yoshio Sano, and Tetsuji Taniguchi

TL;DR
This paper characterizes the special graphs of fat Hoffman graphs with a specific subgraph and a smallest eigenvalue greater than -3, advancing understanding of their spectral properties.
Contribution
It provides a combinatorial characterization of certain fat Hoffman graphs with eigenvalue constraints, focusing on graphs containing a specific subgraph.
Findings
Characterization of special graphs with eigenvalue > -3
Identification of subgraph structures influencing eigenvalues
Extension of Hoffman graph spectral theory
Abstract
In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing with smallest eigenvalue greater than -3, where is the Hoffman graph having one slim vertex and two fat vertices.
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.
