Content deleted Content added
Quack5quack (talk | contribs) Tags: Mobile edit Mobile web edit Advanced mobile edit |
Correct assertion about non-primitive strongly regular graphs |
||
Line 41:
* [[Self-complementary graph|Self-complementary]] [[symmetric graph|arc-transitive]] graphs are strongly regular.
A strongly regular graph is called '''primitive''' if both the graph and its complement are connected. All the above graphs are primitive, as otherwise {{nowrap|μ {{=}} 0}} or {{nowrap|''v'' + λ {{=}} 2''k''}}.
[[Conway's 99-graph problem]] asks for the construction of an srg(99, 14, 1, 2). It is unknown whether a graph with these parameters exists, and [[John Horton Conway]] offered a $1000 prize for the solution to this problem.<ref>{{citation
| |||