Abstract
In this paper, we present that the 2-clique extension of the (t + 1) x (t + 1)-grid is determined by its spectrum if t is large enough. By applying results of Gavrilyuk and Koolen, this implies that the Grassmann graph J(2)(2D, D) is determined by its intersection array as a distance-regular graph if D is large enough. The main tool we are using is Hoffman graphs.
Original language | English |
---|---|
Article number | P1.12 |
Number of pages | 24 |
Journal | Electronic Journal of Combinatorics |
Volume | 24 |
Issue number | 1 |
DOIs | |
Publication status | Published - 20 Jan 2017 |
Keywords
- Hoffman graph
- graph eigenvalue
- interlacing
- walk-regular
- spectral characterizations
- SMALLEST EIGENVALUE