Leaves in representation diagrams of bipartite distance-regular graphs
From MaRDI portal
Publication:1426829
DOI10.1023/B:JACO.0000011939.15842.26zbMath1035.05102MaRDI QIDQ1426829
Publication date: 15 March 2004
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Related Items (2)
On bipartite \(Q\)-polynomial distance-regular graphs ⋮ A characterization of bipartite Leonard pairs using the notion of a tail
Cites Work
- Unnamed Item
- Balanced sets and Q-polynomial association schemes
- A characterization of \(P\)- and \(Q\)-polynomial association schemes
- Tight graphs and their primitive idempotents
- A new inequality for distance-regular graphs
- A new inequality for bipartite distance-regular graphs.
- An inequality involving two eigenvalues of a bipartite distance-regular graph
- Taut distance-regular graphs of even diameter
- Tails of bipartite distance-regular graphs
- Taut distance-regular graphs of odd diameter
- Spin models on bipartite distance-regular graphs
- An inequality on the cosines of a tight distance-regular graph
- Tight distance-regular graphs and the \(Q\)-polynomial property
This page was built for publication: Leaves in representation diagrams of bipartite distance-regular graphs