The basis digraphs of p-schemes
classification
🧮 math.CO
keywords
basisdigraphsp-schemesschemesarbitraryassociationbipartitecharacterization
read the original abstract
It is proved that association schemes with bipartite basis graphs are exactly 2-schemes. This result follows from a characterization of p-schemes for an arbitrary prime p in terms of basis digraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.