The Laplacian spectral excess theorem for distance-regular graphs
From MaRDI portal
Publication:2250930
DOI10.1016/j.laa.2014.06.001zbMath1296.05208arXiv1405.0169OpenAlexW2075971311MaRDI QIDQ2250930
van Dam, Edwin R., Miquel Àngel Fiol
Publication date: 22 July 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.0169
Association schemes, strongly regular graphs (05E30) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Related Items (3)
A class of posets with integral Laplacian spectrum ⋮ A generalization of the odd-girth theorem ⋮ On a version of the spectral excess theorem
Cites Work
- Unnamed Item
- On some approaches to the spectral excess theorem for nonregular graphs
- A spectral excess theorem for nonregular graphs
- Some spectral and quasi-spectral characterizations of distance-regular graphs
- Spectra of 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
- Problems in algebraic combinatorics
- A characterization of distance-regular graphs with diameter three
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Bounds on special subsets in graphs, eigenvalues and association schemes
- A quasi-spectral characterization of strongly distance-regular graphs
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- A characterization of bipartite distance-regular graphs
- On the Polynomial of a Graph
- Pseudo-Strong Regularity Around a Set
This page was built for publication: The Laplacian spectral excess theorem for distance-regular graphs
