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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.