On a Paley-type graph on Z_n
From MaRDI portal
Publication:2115155
Abstract: Let be a prime power such that . The Paley graph of order is the graph with vertex set as the finite field and edges defined as, is an edge if and only if is a non-zero square in . We attempt to construct a similar graph of order , where . For suitable , we construct the graph where the vertex set is the finite commutative ring and edges defined as, is an edge if and only if for some unit of . We look at some properties of this graph. For primes , 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 . In this article, for primes and any positive integer , we find the number of complete subgraphs of order 3 and 4 in our graph defined over .
Recommendations
Cites work
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 3188526 (Why is no real title available?)
- Character sums and Ramsey 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
- On Orthogonal Matrices
- On Sets of Acquaintances and Strangers at any Party
- On certain induced subgraphs of Paley graphs
- On generalised Paley graphs and their automorphism groups
- On the adjacency properties of generalized Paley graphs
- On the adjacency properties of paley graphs
- On the number of complete subgraphs contained in certain graphs
- Paley and the Paley Graphs
- Sums of Gauss, Jacobi, and Jacobsthal
- Unit graphs associated with rings
Cited in
(8)- Hypergeometric functions for Dirichlet characters and Peisert-like graphs on \(\mathbb{Z}_n\)
- The number of edges on generalizations of Paley graphs
- A Paley-like graph in characteristic two
- Paley-type graphs of order a product of two distinct primes
- Generalized Paley graphs and their complete subgraphs of orders three and four
- Enumeration of triangles in quartic residue graphs
- Cliques of orders three and four in the Paley-type graphs
- 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)