On $Q$-Polynomial Association Schemes of Small Class
Keywords:
Distance-regular graph, Q-polynomial association scheme
Abstract
We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
Published
2012-03-31
How to Cite
Suda, S. (2012). On $Q$-Polynomial Association Schemes of Small Class. The Electronic Journal of Combinatorics, 19(1), P68. https://doi.org/10.37236/2157
Article Number
P68