## On \$s\$-distance-transitive graphs. (arXiv:1810.08986v1 [math.CO])

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.查看全文

## Solidot 文章翻译

 你的名字 留空匿名提交 你的Email或网站 用户可以联系你 标题 简单描述 内容 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.
﻿