Content deleted Content added
→The Hoffman–Singleton theorem: Moore graphs are SRG. |
m →Geodetic graphs: Rm superfluous word. |
||
| (One intermediate revision by the same user not shown) | |||
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
===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|
| last1 = Blokhuis | first1 = A.
| last2 = Brouwer | first2 = A. E. | authorlink = Andries Brouwer
| |||