Revision as of 00:01, 30 August 2025 edit Zaslav (talk \| contribs) Extended confirmed users 15,733 edits →The Hoffman–Singleton theorem: Moore graphs are SRG. ← Previous edit		Revision as of 00:03, 30 August 2025 edit undo Zaslav (talk \| contribs) Extended confirmed users 15,733 edits m →Triangle-free graphs: Improve wording. Next edit →
Line 52: ===Triangle-free graphs=== The strongly regular graphs with λ = 0 are [[triangle-free graph\|triangle free]]. Apart from the complete graphs on fewer than 3 vertices and all regular complete bipartite graphs ~~that are regular~~, 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