Revision as of 14:40, 9 September 2023 edit Quack5quack (talk \| contribs) Extended confirmed users 1,064 edits d ← Previous edit		Revision as of 16:46, 9 September 2023 edit undo Suntooooth (talk \| contribs) Extended confirmed users, IP block exemptions, Pending changes reviewers, Rollbackers 10,848 edits Changing short description from "Regular graph where every two directly connected vertices have the same number of mutual neighbors, as do every two indirectly connected vertices." to "Concept in graph theory" Tag: Shortdesc helper Next edit →
Line 1: {{Short description\|Concept in graph theory}} ~~{{Short description\|Regular graph where every two directly connected vertices have the same number of mutual neighbors, as do every two indirectly connected vertices.}}~~ [[Image:Paley13.svg\|thumb\|upright=1.1\|The [[Paley graph]] of order 13, a strongly regular graph with parameters {{math\|srg(13,6,2,3)}}.]] {{Graph families defined by their automorphisms}}

Strongly regular graph: Difference between revisions