Revision as of 02:43, 21 September 2022 edit Hellacioussatyr (talk \| contribs) Extended confirmed users 10,151 edits →The Hoffman–Singleton theorem Tags: Mobile edit Mobile web edit Advanced mobile edit ← Previous edit		Revision as of 22:28, 8 July 2023 edit undo Quack5quack (talk \| contribs) Extended confirmed users 1,064 edits →Triangle-free graphs: Ce Tags: Mobile edit Mobile web edit Advanced mobile edit Next edit →
Line 53: ===Triangle-free graphs=== The strongly regular graphs with λ = 0 are [[triangle-free graph\|triangle free]]. Apart from the complete graphs on ~~less~~fewer than 3 vertices and all complete bipartite graphs, the seven listed earlier (pentagon, Petersen, Clebsch, Hoffman-Singleton, Gewirtz, Mesner-M22, and Higman-Sims) are the only known ones. ===Geodetic graphs===

Strongly regular graph: Difference between revisions