English

Partially metric association schemes with a multiplicity three

Combinatorics 2017-01-13 v1

Abstract

An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity three. Besides the association schemes related to regular complete 44-partite graphs, we obtain the association schemes related to the Platonic solids, the bipartite double scheme of the dodecahedron, and three association schemes that are related to well-known 22-arc-transitive covers of the cube: the M\"{o}bius-Kantor graph, the Nauru graph, and the Foster graph F048A. In order to obtain this result, we also determine the symmetric association schemes with a multiplicity three and a connected relation with valency three. Moreover, we construct an infinite family of cubic arc-transitive 22-walk-regular graphs with an eigenvalue with multiplicity three that give rise to non-commutative association schemes with a symmetric relation of valency three and an eigenvalue with multiplicity three.

Keywords

Cite

@article{arxiv.1701.03193,
  title  = {Partially metric association schemes with a multiplicity three},
  author = {Edwin R. van Dam and Jack H. Koolen and Jongyook Park},
  journal= {arXiv preprint arXiv:1701.03193},
  year   = {2017}
}

Comments

26 pages, 12 figures