On few-class Q-polynomial association schemes: feasible parameters and nonexistence results
DOI:
https://doi.org/10.26493/1855-3974.2101.b76Keywords:
Association scheme, Q-polynomial, feasible parameters, distance-regular graphAbstract
We present the tables of feasible parameters of primitive 3-class Q-polynomial association schemes and 4- and 5-class Q-bipartite association schemes (on up to 2800, 10000, and 50000 vertices, respectively), accompanied by a number of nonexistence results for such schemes obtained by analysing triple intersection numbers of putative open cases.
Downloads
Published
2021-08-19
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/