Distance-transitive graphs of valency five
Distance-transitive graphs of valency five
If u and v are vertices of the (finite, connected) graph Γ, let d ( u, v ) denote the length of the shortest path joining u to v in Γ. The graph Γ is said to be distance-transitive if whenever d ( u, v ) = d ( u …