On few-class Q-polynomial association schemes: feasible parameters and nonexistence results

Authors

DOI:

https://doi.org/10.26493/1855-3974.2101.b76

Keywords:

Association scheme, Q-polynomial, feasible parameters, distance-regular graph

Abstract

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.

Published

2021-08-19

Issue

Section

Articles