Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. 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

The existence is not guanranteed of a strongly regular graph, $d$-regular, every pair of adjacent vertices having $a$ common neighbors, every pair of vertices not adjacent having $b$ common neighbors. But if it does exist for a set of parameters, should the graph ,up to isomorphism, be unique?

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

No. For instance, there are $15$ different Paulus graphs with parameters $(25, 12, 5, 6)$. For more information on strongly regular graphs, be sure to check Andries Brouwer's database and lecture notes.

share|cite|improve this answer

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.