On some distance-regular graphs with many vertices
Abstract
We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups G2(4) and G2(5), the orthogonal group O(7,3) and the Tits group T=2F4(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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.