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

Alexander L. Gavrilyuk; Janoš Vidali; Jason S. Williford

doi:10.26493/1855-3974.2101.b76

Authors

Alexander L. Gavrilyuk Pusan National University, Republic of Korea https://orcid.org/0000-0001-9296-0313
Janoš Vidali University of Ljubljana, Slovenia and Institute of Mathematics, Physics and Mechanics, Slovenia https://orcid.org/0000-0001-8061-9169
Jason S. Williford University of Wyoming, United States https://orcid.org/0000-0002-8697-5997

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.

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

Authors

DOI:

Keywords:

Abstract

Downloads

Published

Issue

Section

License

Developed By

Information