On a correspondence between maximal cliques in Paley graphs of square order
Combinatorics
2022-04-15 v3 Complex Variables
Abstract
Let be an odd prime power. Denote by the value of modulo 4. In this paper, we establish a linear fractional correspondence between two types of maximal cliques of size in the Paley graph of order .
Cite
@article{arxiv.2102.03822,
title = {On a correspondence between maximal cliques in Paley graphs of square order},
author = {Sergey Goryainov and Alexander Masley and Leonid Shalaginov},
journal= {arXiv preprint arXiv:2102.03822},
year = {2022}
}