On the classification of triply-transitive strongly-regular graphs
Allen Herman, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra

TL;DR
This paper classifies all triply transitive strongly-regular graphs, excluding certain known examples, by analyzing their Terwilliger algebras and symmetry properties.
Contribution
It provides a complete classification of triply transitive strongly-regular graphs beyond known special cases, advancing understanding of their algebraic and combinatorial structure.
Findings
Identifies all such graphs not isomorphic to known polar or affine polar graphs.
Establishes conditions under which the Terwilliger algebra equals the centralizer algebra.
Shows the uniqueness of certain strongly-regular graphs with high symmetry.
Abstract
Let be a strongly-regular graph with adjacency matrix , and let be the adjacency matrix of its complement. For any vertex , we define and to be respectively the diagonal matrices whose main diagonal is the row corresponding to in the matrices , and . The Terwilliger algebra of with respect to the vertex is the subalgebra of the complex matrix algebra . The algebra contains the subspace . In addition, if , then is a subalgebra of the centralizer algebra…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
