Revision as of 00:03, 30 August 2025 edit Zaslav (talk \| contribs) Extended confirmed users 15,727 edits m →Triangle-free graphs: Improve wording. ← Previous edit		Latest revision as of 01:00, 30 August 2025 edit undo Zaslav (talk \| contribs) Extended confirmed users 15,727 edits m →Geodetic graphs: Rm superfluous word.
Line 55: ===Geodetic graphs=== Every strongly regular graph with <math>\mu = 1</math> is a [[geodetic graph]], a graph in which every two vertices have a unique [[Shortest path problem\|~~unweighted~~ shortest path]].<ref name=bb>{{citation \| last1 = Blokhuis \| first1 = A. \| last2 = Brouwer \| first2 = A. E. \| authorlink = Andries Brouwer

Strongly regular graph: Difference between revisions