Papers
Topics
Authors
Recent
Search
2000 character limit reached

Weakly distance-regular digraphs of one type of arcs

Published 2 Aug 2021 in math.CO | (2108.00613v1)

Abstract: In this paper, we classify all commutative weakly distance-regular digraphs of girth $g$ and one type of arcs under the assumption that $p_{(1,g-1),(1,g-1)}{(2,g-2)}\geq k_{1,g-1}-2$. In consequence, we recover [13, Theorem 1.1] as a special case of our result.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.