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

Authors

Alexander L. Gavrilyuk, Pusan National University
Janoš Vidali, Univerza v Ljubljani
Jason S. Williford, College of Engineering and Physical Sciences

Abstract

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

Publication Title

Ars Mathematica Contemporanea

Recommended Citation

Gavrilyuk, A., Vidali, J., & Williford, J. (2021). On few-class Q-polynomial association schemes: Feasible parameters and nonexistence results. Ars Mathematica Contemporanea, 20 (1), 103-127. https://doi.org/10.26493/1855-3974.2101.B76