Weakly distance-regular digraphs of one type of arcs
Yushuang Fan, Zhiqi Wang, Yuefeng Yang

TL;DR
This paper classifies a specific class of weakly distance-regular directed graphs with one arc type, girth g, under certain algebraic conditions, extending previous results in the field.
Contribution
It provides a complete classification of commutative weakly distance-regular digraphs of girth g with one arc type under a key algebraic inequality.
Findings
Classification of all such digraphs under the given conditions
Recovery of a known theorem as a special case
Extension of previous classification results
Abstract
In this paper, we classify all commutative weakly distance-regular digraphs of girth and one type of arcs under the assumption that . In consequence, we recover [13, Theorem 1.1] as a special case of our result.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
