On some distance-regular graphs with many vertices

2018/09/26 by Crnkovic, Dean, Rukavina, Sanja, Svob, Andrea
#05E18 #05E30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1809.10197

Abstract

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups G₂(4) and G₂(5), the orthogonal group O(7,3) and the Tits group T=²F₄(2)'. Most of the constructed graphs have more than 1000 vertices, and the number of vertices goes up to 28431. Some of the obtained graphs are new.

Related

• Automorphism group of a family of distance regular graphs which are not distance transitive
• Distance-regular graph with large a1 or c2
• Distance-regular graphs obtained from the Mathieu groups
• On s-distance-transitive graphs
• Distance-regular Cayley graphs over ℤ_p^s⊕ℤ_p