Weakly distance-regular digraphs whose attached association schemes are regular
Yuefeng Yang, Benjian Lv, Kaishun Wang

TL;DR
This paper investigates a specific class of weakly distance-regular directed graphs with regular association schemes, providing a characterization of mixed arcs and classifying such graphs with diameter 2.
Contribution
It offers a new characterization of mixed arcs and classifies weakly distance-regular digraphs with regular attached association schemes of diameter 2.
Findings
Characterization of mixed arcs in the studied digraphs
Classification of diameter 2 cases
Insights into the structure of regular association schemes
Abstract
In this paper, we study commutative weakly distance-regular digraphs whose attached association schemes are regular, and give a characterization of mixed arcs. As an application, we classify such digraphs of diameter 2.
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 · Coding theory and cryptography · graph theory and CDMA systems
