Characterizing distance-regularity of graphs by the spectrum
From MaRDI portal
Publication:855882
DOI10.1016/j.jcta.2006.03.008zbMath1105.05076OpenAlexW2170819362WikidataQ56001772 ScholiaQ56001772MaRDI QIDQ855882
Jack H. Koolen, Willem H. Haemers, Spence, Edward, van Dam, Edwin R.
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/4a2b71be-1428-4de9-a18b-755600acee20
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (27)
Godsil-McKay switching and twisted Grassmann graphs ⋮ Hypercubes are determined by their distance spectra ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ Distance-regular graphs of diameter 3 having eigenvalue \(-1\) ⋮ A switching for all strongly regular collinearity graphs from polar spaces ⋮ On the spectral characterization of the union of complete multipartite graph and some isolated vertices ⋮ Spectral characterization of some cubic graphs ⋮ Note on the spectral characterization of some cubic graphs with maximum number of triangles ⋮ Cospectral mates for the union of some classes in the Johnson association scheme ⋮ Cospectral mates for generalized Johnson and Grassmann graphs ⋮ INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM ⋮ Integral graphs obtained by dual Seidel switching ⋮ On almost distance-regular graphs ⋮ GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS ⋮ An odd characterization of the generalized odd graphs ⋮ A generalization of a theorem of Hoffman ⋮ Spectra of strongly Deza graphs ⋮ Spectral characterization of the Hamming graphs ⋮ Some spectral and quasi-spectral characterizations of distance-regular graphs ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ On perturbations of almost distance-regular graphs ⋮ A short proof of a theorem of Bang and Koolen ⋮ New strongly regular graphs from finite geometries via switching ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Developments on spectral characterizations of graphs ⋮ Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues ⋮ A new family of distance-regular graphs with unbounded diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- Three-class association schemes
- Spectral characterization of some generalized odd graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- Spectral characterizations of some distance-regular graphs
- Combinatorial designs with two singular values. II: Partial geometric designs
- A computer-assisted proof of the uniqueness of the Perkel graph
- Distance-regularity and the spectrum of graphs
- On symmetric nets and generalized Hadamard matrices from affine designs
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- A new family of distance-regular graphs with unbounded diameter
- On the Polynomial of a Graph
- Graphs cospectral with distance-regular graphs
- Distance-transitive graphs of valency 5, 6 and 7
This page was built for publication: Characterizing distance-regularity of graphs by the spectrum
