On eigenfunctions and maximal cliques of Paley graphs of square order
Combinatorics
2021-03-02 v1
Abstract
In this paper we find new maximal cliques of size or , accordingly as or , in Paley graphs of order , where is an odd prime power. After that we use new cliques to define a family of eigenfunctions corresponding to both non-principal eigenvalues and having the cardinality of support , which is the minimum by the weight-distribution bound.
Keywords
Cite
@article{arxiv.1801.00438,
title = {On eigenfunctions and maximal cliques of Paley graphs of square order},
author = {Sergey Goryainov and Vladislav V. Kabanov and Leonid Shalaginov and Alexandr Valyuzhenich},
journal= {arXiv preprint arXiv:1801.00438},
year = {2021}
}