Characterizing distance-regularity of graphs by the spectrum
DOI10.1016/J.JCTA.2006.03.008zbMATH Open1105.05076OpenAlexW2170819362WikidataQ56001772 ScholiaQ56001772MaRDI QIDQ855882FDOQ855882
Jack H. Koolen, Willem H. Haemers, Edward Spence, Edwin R. Van Dam
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)
Cites Work
- Title not available (Why is that?)
- Constructing cospectral graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- On the Polynomial of a Graph
- Title not available (Why is that?)
- Uniqueness and nonexistence of some graphs related to \(M_{22}\)
- Combinatorial designs with two singular values. II: Partial geometric designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new family of distance-regular graphs with unbounded diameter
- Three-class association schemes
- Spectral characterization of some generalized odd graphs
- Graphs cospectral with distance-regular graphs
- Title not available (Why is that?)
- Spectral characterizations of some distance-regular graphs
- Distance-regularity and the spectrum of graphs
- On symmetric nets and generalized Hadamard matrices from affine designs
- A computer-assisted proof of the uniqueness of the Perkel graph
- Classification of three-class association schemes using backtracking with dynamic variable ordering
- Distance-transitive graphs of valency 5, 6 and 7
Cited In (29)
- An odd characterization of the generalized odd graphs
- New strongly regular graphs from finite geometries via switching
- INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM
- A generalization of a theorem of Hoffman
- On the spectral characterization of the union of complete multipartite graph and some isolated vertices
- The distance-regular graphs such that all of its second largest local eigenvalues are at most one
- A short proof of a theorem of Bang and Koolen
- Developments on spectral characterizations of graphs
- On perturbations of almost distance-regular graphs
- Spectral characterizations of some distance-regular graphs
- Spectra of strongly Deza graphs
- A new family of distance-regular graphs with unbounded diameter
- Hypercubes are determined by their distance spectra
- Distance-regular graphs of diameter 3 having eigenvalue \(-1\)
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Spectral characterization of the Hamming graphs
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
- Note on the spectral characterization of some cubic graphs with maximum number of triangles
- On almost distance-regular graphs
- Godsil-McKay switching and twisted Grassmann graphs
- Regular graphs with girth at least 5 and small second largest eigenvalue
- Spectral characterization of some cubic graphs
- Cospectral mates for the union of some classes in the Johnson association scheme
- A switching for all strongly regular collinearity graphs from polar spaces
- Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
- Integral graphs obtained by dual Seidel switching
- Cospectral mates for generalized Johnson and Grassmann graphs
- A quasi-spectral characterization of strongly distance-regular graphs
Recommendations
This page was built for publication: Characterizing distance-regularity of graphs by the spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855882)
