On a Paley-type graph on Z_n

DOI10.1007/S00373-021-02426-2zbMATH Open1484.05100arXiv2012.09735OpenAlexW4210809872MaRDI QIDQ2115155FDOQ2115155

Authors: Anwita Bhowmik, Rupam Barman 

Publication date: 15 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Let $q$ be a prime power such that $qequiv1pmod4$. The Paley graph of order $q$ is the graph with vertex set as the finite field $mathbb{F}_q$ and edges defined as, $ab$ is an edge if and only if $a-b$ is a non-zero square in $mathbb{F}_q$. We attempt to construct a similar graph of order $n$, where $ninmathbbN$. For suitable $n$, we construct the graph where the vertex set is the finite commutative ring $mathbb{Z}_n$ and edges defined as, $ab$ is an edge if and only if $a-bequiv{x}^{2}pmodn$ for some unit $x$ of $mathbb{Z}_n$. We look at some properties of this graph. For primes $pequiv1pmod4$, Evans, Pulham and Sheehan computed the number of complete subgraphs of order 4 in the Paley graph. Very recently, Dawsey and McCarthy find the number of complete subgraphs of order 4 in the generalized Paley graph of order $q$. In this article, for primes $pequiv1pmod4$ and any positive integer $alpha$, we find the number of complete subgraphs of order 3 and 4 in our graph defined over $mathbb{Z}_{p^{alpha}}$.

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

Recommendations

• Generalized Paley graphs and their complete subgraphs of orders three and four
• Paley-type graphs of order a product of two distinct primes
• Some colouring problems for Paley graphs
• The number of edges on generalizations of Paley graphs
• The Smith and critical groups of Paley graphs

zbMATH Keywords

finite fieldscharacter sumsDirichlet charactersPaley graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Unit graphs associated with rings
• Paley and the Paley Graphs
• On the adjacency properties of paley graphs
• Character sums and Ramsey properties of generalized Paley graphs
• Title not available (Why is that?)
• On Sets of Acquaintances and Strangers at any Party
• On Orthogonal Matrices
• On generalised Paley graphs and their automorphism groups
• On the number of complete subgraphs contained in certain graphs
• Sums of Gauss, Jacobi, and Jacobsthal
• On the adjacency properties of generalized Paley graphs
• Cubic and quadruple Paley graphs with the \(n\)-e.c. property
• Generalized Paley graphs and their complete subgraphs of orders three and four
• Title not available (Why is that?)

Cited In (6)

• Enumeration of triangles in quartic residue graphs
• Cliques of orders three and four in the Paley-type graphs
• A Paley-like graph in characteristic two
• The number of edges on generalizations of Paley graphs
• Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\)
• Number of complete subgraphs of peisert graphs and finite field hypergeometric functions

This page was built for publication: On a Paley-type graph on \({\mathbb{Z}}_n\)

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