On generalised Paley graphs and their automorphism groups
From MaRDI portal
Publication:1024883
DOI10.1307/MMJ/1242071694zbMATH Open1284.05175arXivmath/0605252OpenAlexW2051631358WikidataQ56987725 ScholiaQ56987725MaRDI QIDQ1024883FDOQ1024883
Authors: 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
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal overgroups of Singer elements in classical groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear Groups with Orders Having Certain Large Prime Divisors
- The Inclusion Problem for Finite Primitive Permutation Groups
- Title not available (Why is that?)
- On Orthogonal Matrices
- Title not available (Why is that?)
- On partitioning the orbitals of a transitive permutation group
- Singer-Zyklen in klassischen Gruppen
- Homogeneous factorisations of complete graphs with edge-transitive factors
- All self-complementary symmetric graphs
- Pseudo-ordered polynomials over a finite field
- Closures of Finite Primitive Permutation Groups
Cited In (39)
- Generalised Paley graphs with a product structure
- Waring numbers over finite commutative local rings
- On the Paley graph of a quadratic character
- The EKR-module property of pseudo-Paley graphs of square order
- Gauss sums and the maximum cliques in generalized Paley graphs of square order
- Title not available (Why is that?)
- Automorphisms group of generalized Hamming Graphs
- The Waring's problem over finite fields through generalized Paley graphs
- Locally Paley graphs
- Van Lint-MacWilliams' conjecture and maximum cliques in Cayley graphs over finite fields
- Cliques of orders three and four in the Paley-type graphs
- Gossiping and routing in second-kind Frobenius graphs
- Eigenvalues of Cayley graphs
- On geodesic transitive graphs
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
- The isoperimetric number of a generalized Paley graph
- Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\)
- Automorphism groups of Paley graphs and cyclotomic schemes
- On the directions determined by Cartesian products and the clique number of generalized Paley graphs
- Generalized Paley graphs and their complete subgraphs of orders three and four
- Number of complete subgraphs of peisert graphs and finite field hypergeometric functions
- Generalized Paley graphs equienergetic with their complements
- Infinite Paley graphs
- On maximal cliques of Cayley graphs over fields
- Paley-type graphs of order a product of two distinct primes
- On WL-rank and WL-dimension of some Deza circulant graphs
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
- On 2-distance-transitive circulants
- The weight distribution of irreducible cyclic codes associated with decomposable generalized Paley graphs
- On a Paley-type graph on \({\mathbb{Z}}_n\)
- Cliques and colorings in generalized Paley graphs and an approach to synchronization
- Characterisations and Galois conjugacy of generalised Paley maps
- On eigenfunctions and maximal cliques of generalised Paley graphs of square order
- Permutation decoding of codes from generalized Paley graphs
- Orbits of finite-field hypergeometric functions and complete subgraphs of generalized Paley graphs
- A reduction formula for Waring numbers through generalized Paley graphs
- Paley and the Paley Graphs
- On diagonal equations over finite fields via walks in NEPS of graphs
- A classification of one-dimensional affine rank three graphs
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)
