Fat Hoffman graphs with smallest eigenvalue greater than -3
Abstract
In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing K1,2 with smallest eigenvalue greater than -3, where K1,2 is the Hoffman graph having one slim vertex and two fat vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.