On s-distance-transitive graphs

Authors Hui Zhou, Cheryl E. Praeger, Michael Giudici, Rongquan Feng, Xin Gui Fang

Publication date 21 October 2018

Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

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.

This page was built for publication: On $s$-distance-transitive graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6308551)