Paley graph

From Graph
Revision as of 03:31, 28 May 2012 by Vipul (talk | contribs) (Created page with "==Definition== Suppose <math>q</math> is a prime power such that <math>q \equiv 1 \pmod 4</math>. The '''Paley graph''' on <math>q</math> vertices is defined as follows: ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Definition

Suppose is a prime power such that . The Paley graph on vertices is defined as follows:

  1. The vertex set is identified with the elements of the field of elements. This field is unique up to field isomorphism.
  2. Given any two distinct vertices , and are defined to be adjacent if and only if is a square in .

The significance of is that this forces -1 to be a square, hence is a square if and only if is a square. This is necessary because we want the definition of adjacency to be symmetric in the two vertices.