Weakly distance-regular digraphs of diameter 2
Xiangli Wang, Yuefeng Yang
TL;DR
This paper characterizes all weakly distance-regular directed graphs with diameter 2, extending the understanding of their structure and properties in the context of graph theory.
Contribution
It provides a complete classification of weakly distance-regular digraphs of diameter 2, a previously uncharacterized class.
Findings
Complete characterization of weakly distance-regular digraphs of diameter 2
Identification of structural properties unique to these digraphs
Extension of distance-regular graph theory to directed graphs
Abstract
Weakly distance-regular digraphs is a directed version of distance-regular graphs. In this paper, we characterize all weakly distance-regular 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
TopicsRings, Modules, and Algebras · graph theory and CDMA systems · Finite Group Theory Research