Cliques of orders three and four in the Paley-type graphs

arXiv2301.07021MaRDI QIDQ6423633FDOQ6423633

Publication date: 17 January 2023

Abstract: Let

n = 2^{s} p_{1}^{a l p h a_{1}} c d o t s p_{k}^{a l p h a_{k}}

, where

s = 0

or

1

,

a l p h a_{i} g e q 1

, and the distinct primes

p_{i}

satisfy

p_{i} e q u i v 1 p m o d 4

for all

i = 1, l d o t s, k

. Let

m a t h b b Z_{n}^{a} s t

denote the group of units in the commutative ring

m a t h b b Z_{n}

. Recently, we defined a Paley-type graph

G_{n}

of order

n

as the graph whose vertex set is

m a t h b b Z_{n}

and

x y

is an edge if

x - y e q u i v a^{2} p m o d n

for some

a i n m a t h b b Z_{n}^{a} s t

. The Paley-type graph

G_{n}

resembles the classical Paley graph in a number of ways, and adds to the list of generalizations of the Paley graph. Computing the number of cliques of a particular order in a Paley graph or its generalizations has been of considerable interest. For primes

p e q u i v 1 p m o d 4

and

a l p h a g e q 1

, by evaluating certain character sums, we found the number of cliques of order

3

in

G_{p^{a} l p h a}

and expressed the number of cliques of order

4

in

G_{p^{a} l p h a}

in terms of Jacobi sums. In this article we give combinatorial proofs and find the number of cliques of orders

3

and

4

in

G_{n}

for all

n

for which the graph is defined.

This page was built for publication: Cliques of orders three and four in the Paley-type graphs

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