2000 character limit reached
Weakly distance-regular digraphs of valency three, II
Published 23 Nov 2016 in math.CO | (1611.07764v3)
Abstract: In this paper, we classify commutative weakly distance-regular digraphs of valency 3 with girth more than 2 and one type of arcs. Combining [8, Theorem 1.2], [10, Theorem 1.3] and [11, Theorem 1], commutative weakly distanceregular digraphs of valency 3 are completely determined.
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.