Paley Graphs and Their Generalizations

Elsawy, Ahmed Noubi

doi:10.48550/arxiv.1203.1818

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction and Statement Of Main Results1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Paley graph of order q is the graph with vertex set F q where ab is an edge if and only if a − b ∈ S 2 . The Paley graphs are connected, self-complementary and strongly regular with parameters q, q − 1 2 , q − 5 4 , q − 1 4 , see for example [8]. Paley graphs were first introduced in 1933 by Paley [15].…”

Section: Introduction and Statement Of Main Resultsmentioning

confidence: 99%

On a Paley-type graph on $\mathbb{Z}_n$

Bhowmik¹,

Barman²

2020

Preprint

View full text Add to dashboard Cite

Let q be a prime power such that q ≡ 1 (mod 4). The Paley graph of order q is the graph with vertex set as the finite field Fq and edges defined as, ab is an edge if and only if a − b is a non-zero square in Fq. We attempt to construct a similar graph of order n, where n is a positive integer. For suitable n, we construct the graph where the vertex set is the finite commutative ring Zn and edges defined as, ab is an edge if and only if a − b ≡ x 2 (mod n) for some unit x of Zn. We look at some properties of this graph. For primes p ≡ 1 (mod 4), Evans, Pulham and Sheehan computed the number of complete subgraphs of order 4 in the Paley graph of order p. 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, we find the number of complete subgraphs of order 3 and 4 in our graph defined over Zn.

show abstract

Section: Introduction and Statement Of Main Resultsmentioning

confidence: 99%