Fat Hoffman graphs with smallest eigenvalue greater than -3
classification
🧮 math.CO
cs.DM
keywords
graphshoffmaneigenvaluegreatermathfraksmallestcharacterizationcombinatorial
read the original abstract
In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing $\mathfrak{K}_{1,2}$ with smallest eigenvalue greater than -3, where $\mathfrak{K}_{1,2}$ is the Hoffman graph having one slim vertex and two fat vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.