On s-distance-transitive graphs

2018/10/21 by Hui Zhou, Zhou, Hui, Cheryl E. Praeger +7
Engineering · Mathematics · #05B30 #05C25 #20B25 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1810.08986

openalex publication_date 2018/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitivity implies distance-regularity. In this paper, we give similar results, i.e. for special s and graphs with other restrictions we show that s-distance-transitivity implies distance-regularity.

Related

• Edge-distance-regular graphs are distance-regular
• Distance-balanced graphs: symmetry conditions
• On two-distance-transitive graphs
• Pseudo-distance-regularised graphs are distance-regular or distance-biregular
• Distance-regular graphs, the subconstituent algebra, and the Q-polynomial property