On s-distance-transitive graphs

Hui Zhou, Cheryl Praeger, Michael Giudici, Rongquan Feng, Xingui Fang

Research output: Working paperPreprint

2 Downloads (Pure)

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.
Original languageEnglish
PublisherarXiv
Number of pages34
Publication statusUnpublished - 21 Oct 2018

Fingerprint

Dive into the research topics of 'On s-distance-transitive graphs'. Together they form a unique fingerprint.

Cite this