On a Paley-type graph on Z_n

From MaRDI portal
Publication:2115155

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

Rupam Barman, Anwita Bhowmik

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 mathbbFq and edges defined as, ab is an edge if and only if ab is a non-zero square in mathbbFq. 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 mathbbZn and edges defined as, ab is an edge if and only if abequivx2pmodn for some unit x of mathbbZn. 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 mathbbZpalpha.


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




Recommendations




Cites Work


Cited In (5)





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)