On $s$-distance-transitive graphs
Combinatorics
2018-10-23 v1
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 and graphs with other restrictions we show that -distance-transitivity implies distance-regularity.
Cite
@article{arxiv.1810.08986,
title = {On $s$-distance-transitive graphs},
author = {Hui Zhou and Cheryl Praeger and Michael Giudici and Rongquan Feng and Xingui Fang},
journal= {arXiv preprint arXiv:1810.08986},
year = {2018}
}
Comments
34 pages