Strongly regular graph: Difference between revisions

Revision as of 16:11, 24 May 2025

Revision as of 19:25, 2 June 2025

Line 196:

* ''k'' = 3 and ''v'' = 10 yields the [[Petersen graph]],

* ''k'' = 7 and ''v'' = 50 yields the [[Hoffman–Singleton graph]], discovered by Hoffman and Singleton in the course of this analysis, and

* ''k'' = 57 and ''v'' = 3250 famously predicts a famous graph that has neither been discovered since 1960, nor has its existence been disproven.<ref>{{citation

| last = Dalfó | first = C.

| doi = 10.1016/j.laa.2018.12.035