A spectral characterization of the s-clique extension of the square grid graphs
From MaRDI portal
(Redirected from Publication:1633608)
A spectral characterization of the \(s\)-clique extension of the square grid graphs
A spectral characterization of the \(s\)-clique extension of the square grid graphs
Abstract: In this paper we show that for integers , , any co-edge-regular graph which is cospectral with the -clique extension of the -grid is the -clique extension of the -grid, if is large enough. Gavrilyuk and Koolen used a weaker version of this result to show that the Grassmann graph is characterized by its intersection array as a distance-regular graph, if is large enough.
Recommendations
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- An application of Hoffman graphs for spectral characterizations of graphs
- Characterizing distance-regularity of graphs by the spectrum
- Spectral characterizations of some distance-regular graphs
- A generalization of a theorem of Hoffman
Cites work
- A generalization of a theorem of Hoffman
- An application of Hoffman graphs for spectral characterizations of graphs
- Distance-regular graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- On graphs with smallest eigenvalue at least \(-3\) and their lattices
- On regular graphs with four distinct eigenvalues
- On the Polynomial of a Graph
- Regular graphs with four eigenvalues
- Small regular graphs with four eigenvalues
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- Three-class association schemes
Cited in
(10)- Two characterizations of the grid graphs
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- The enumeration of spanning tree of weighted graphs
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs
- A spectral characterization of the \(s\)-clique extension of the triangular graphs
- An application of Hoffman graphs for spectral characterizations of graphs
- A characterization of the Grassmann graphs
- Some orbits of a two-vertex stabilizer in a Grassmann graph
- On co-edge-regular graphs with 4 distinct eigenvalues
This page was built for publication: A spectral characterization of the \(s\)-clique extension of the square grid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633608)