adv

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

来源于:arXiv
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. 查看全文>>

发表评论