An application of Hoffman graphs for spectral characterizations of graphs
classification
🧮 math.CO
keywords
graphsapplicationcharacterizationsdeterminedenoughgraphhoffmanlarge
read the original abstract
In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the $2$-clique extension of the $(t+1)\times(t+1)$-grid is determined by its spectrum when $t$ is large enough. This result will help to show that the Grassmann graph $J_2(2D,D)$ is determined by its intersection numbers as a distance regular graph, if $D$ is large enough.
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.