Twice \(Q\)-polynomial distance-regular graphs of diameter 4
From MaRDI portal
Publication:2629812
DOI10.1007/s11425-014-4958-0zbMath1341.05253arXiv1405.2546OpenAlexW1975309696MaRDI QIDQ2629812
Publication date: 7 July 2016
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.2546
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connectedness of the complement of a ball in distance-regular graphs
- Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes
- Distance-regular graphs with or at least half the valency
- Non-existence of imprimitive \(Q\)-polynomial schemes of exceptional type with \(d=4\)
- Tight graphs and their primitive idempotents
- Imprimitive Q-polynomial association schemes
- Association schemes with multiple Q-polynomial structures
- Tight distance-regular graphs
- Dual bipartite Q-polynomial distance-regular graphs
- On the multiplicity of eigenvalues of distance-regular graphs
- Twice Q-polynomial distance-regular graphs are thin
- Distance-regular graphs with a relatively small eigenvalue multiplicity
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- Tight distance-regular graphs and the \(Q\)-polynomial property