On eigenfunctions and maximal cliques of generalised Paley graphs of square order
Combinatorics
2023-08-30 v3 Number Theory
Abstract
Let GP be the -Paley graph defined on the finite field with order . We study eigenfunctions and maximal cliques in generalised Paley graphs GP, where . In particular, we explicitly construct maximal cliques of size or in GP, and show the weight-distribution bound on the cardinality of the support of an eigenfunction is tight for the smallest eigenvalue of GP. These new results extend the work of Baker et. al and Goryainov et al. on Paley graphs of square order. We also study the stability of the Erd\H{o}s-Ko-Rado theorem for GP (first proved by Sziklai).
Keywords
Cite
@article{arxiv.2203.16081,
title = {On eigenfunctions and maximal cliques of generalised Paley graphs of square order},
author = {Sergey Goryainov and Leonid Shalaginov and Chi Hoi Yip},
journal= {arXiv preprint arXiv:2203.16081},
year = {2023}
}