On generalised Paley graphs and their automorphism groups

From MaRDI portal
Publication:1024883

DOI10.1307/MMJ/1242071694zbMATH Open1284.05175arXivmath/0605252OpenAlexW2051631358WikidataQ56987725 ScholiaQ56987725MaRDI QIDQ1024883FDOQ1024883

T. H. Kim, Cheryl E. Praeger

Publication date: 17 June 2009

Published in: Michigan Mathematical Journal (Search for Journal in Brave)

Abstract: The generalised Paley graphs are, as their name suggests, a generalisation of the Paley graphs, first defined by Paley in 1933 (see cite{Paley}). They arise as the relation graphs of symmetric cyclotomic association schemes. However, their automorphism groups may be much larger than the groups of the corresponding schemes. We determine the parameters for which the graphs are connected, or equivalently, the schemes are primitive. Also we prove that generalised Paley graphs are sometimes isomorphic to Hamming graphs and consequently have large automorphism groups, and we determine precisely the parameters for this to occur. We prove that in the connected, non-Hamming case, the automorphism group of a generalised Paley graph is a primitive group of affine type, and we find sufficient conditions under which the group is equal to the one-dimensional affine group of the associated cyclotomic association scheme. The results have been applied in cite{LLP} to distinguish between cyclotomic schemes and similar twisted versions of these schemes, in the context of homogeneous factorisations of complete graphs.


Full work available at URL: https://arxiv.org/abs/math/0605252




Recommendations




Cites Work


Cited In (37)

Uses Software





This page was built for publication: On generalised Paley graphs and their automorphism groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024883)