Quasi-thin weakly distance-regular digraphs
From MaRDI portal
Abstract: A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3. As a result, this family of digraphs are completely determined.
Recommendations
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- An algebraic approach to association schemes
- Commutative weakly distance-regular digraphs of girth 2.
- Generalized table algebras
- On quasi-thin association schemes
- On quasi-thin association schemes
- On quasi-thin association schemes with odd number of points
- Theory of Association Schemes
- Thin weakly distance-regular digraphs
- Weakly distance-regular digraphs
- Weakly distance-regular digraphs of valency three, II
- Weakly distance-regular digraphs of valency three. I
Cited in
(11)- Weakly distance-regular digraphs whose underlying graphs are distance-regular. I
- Weakly distance-regular digraphs of valency three. I
- Thick weakly distance-regular digraphs
- Weakly distance-regular digraphs of one type of arcs
- Weakly distance-regular digraphs of valency three, II
- Thin weakly distance-regular digraphs
- On weak metric dimension of digraphs
- scientific article; zbMATH DE number 1379440 (Why is no real title available?)
- \(P\)-polynomial weakly distance-regular digraphs
- A family of weakly distance-regular digraphs of girth 2
- Weakly distance-regular digraphs.
This page was built for publication: Quasi-thin weakly distance-regular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304192)