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 language | English |
---|---|
Publisher | arXiv |
Number of pages | 34 |
Publication status | Unpublished - 21 Oct 2018 |