On maximal cliques of Cayley graphs over fields
classification
🧮 math.CO
keywords
graphsmaximalcayleycliquesorderpaleyadditiveclass
read the original abstract
We describe a new class of maximal cliques, with a vector space structure, of Cayley graphs defined on the additive group of a field. In particular, we show that in the cubic Paley graph with order $q^3$, the subfield with $q$ elements forms a maximal clique. Similar statements also hold for quadruple Paley graphs and Peisert graphs with quartic order.
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.