MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It is known that the Paley graph $P(q)$ for $q = 5, 9, 13$ or $17$ vertices are the only strongly regular graph with the parameters as $P(q)$.

If $q \geq 25$, is the following assertion true:

There are strongly regular graphs $G$ with the same parameters as $P(q)$ such that $G\not\cong P(q)$.

share|cite|improve this question
up vote 3 down vote accepted

If $p$ is a prime congruent to 3 (mod 4) and $q$ is an even power of $q$, there are the Peisert graphs which are arc-transitive, self-complementary conference graphs, not isomorphic to Paley graphs.

More generally, start with the affine plane over $GF(q)$ where $q$ is odd, with point set $GF(q)\times GF(q)$. Choose a subset $P$ of $GF(q)\cup\infty$ and define $X(P)$ to be the graph with the points of the plane as vertices, with two points adjacent if they are distinct and the slope of the affine line joining them is in $P$. Then $X(P)$ is strongly regular, and if $|P|=(1+q)/2$, then $X(P)$ is a conference graph. When $q$ is large, we get many non-isomorphic graphs. (The Peisert graphs can be obtained in this way.)

For more on these topics, see Natalie Mullin's Ph.D. thesis (

As you can see from Brouwer's tables (, there are 41 conference graphs on 29 vertices. According to the same source, conference graphs on fewer than 25 vertices are Paley graphs and there are 15 conference graphs on 25 vertices.

I do not recall seeing any general procedure for constructing conference graphs on a prime number of vertices that are not isomorphic to Paley graphs.

share|cite|improve this answer
@Chris: Many Thanks – Alireza Abdollahi Jan 22 '13 at 19:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.