The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
From MaRDI portal
Publication:5240723
DOI10.1080/03081087.2018.1491944zbMath1425.05091arXiv1608.00373OpenAlexW2963311738MaRDI QIDQ5240723
C. Dalfó, Miquel Àngel Fiol, Jack H. Koolen
Publication date: 29 October 2019
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00373
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Distance-regular graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Distance regular graphs of diameter 3 and strongly regular graphs
- A simple proof of the spectral excess theorem for distance-regular graphs
- The spectral excess theorem for distance-regular graphs: a global (over)view
- Locally pseudo-distance-regular graphs
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- An eigenvalue characterization of antipodal distance-regular graphs
- A quasi-spectral characterization of strongly distance-regular graphs
- Distance-regular graphs where the distance-\(d\) graph has fewer distinct eigenvalues
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- On almost distance-regular graphs
- Some Spectral Characterizations of Strongly Distance-Regular Graphs
- On the Polynomial of a Graph
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- The spectral excess theorem for distance-regular graphs having distance-\(d\) graph with fewer distinct eigenvalues
This page was built for publication: The spectral excess theorem for graphs with few eigenvalues whose distance-2 or distance-1-or-2 graph is strongly regular
