The spectral excess theorem for distance-biregular graphs.
From MaRDI portal
Publication:396831
zbMath1295.05272arXiv1304.4354MaRDI QIDQ396831
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.4354
Related Items (3)
On the Terwilliger algebra of distance-biregular graphs ⋮ The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-distance-regularized graphs are distance-regular or distance-biregular
- 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
- Locally pseudo-distance-regular graphs
- Distance biregular bipartite graphs
- Algebraic characterizations of distance-regular graphs
- From local adjacency polynomials to locally pseudo-distance-regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes
- On almost distance-regular graphs
- On the Polynomial of a Graph
- On the algebraic theory of pseudo-distance-regularity around a set
This page was built for publication: The spectral excess theorem for distance-biregular graphs.
