Semicomplete multipartite weakly distance-regular digraphs
From MaRDI portal
Cites work
- \(P\)-polynomial weakly distance-regular digraphs
- Algebraic combinatorics. Translated from the Japanese
- An algebraic approach to association schemes
- Commutative weakly distance-regular digraphs of girth 2.
- Distance-regular graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- Normally regular digraphs, association schemes and related combinatorial structures
- Quasi-thin weakly distance-regular digraphs
- Semicomplete multipartite weakly distance-regular digraphs
- Theory of Association Schemes
- Thick weakly distance-regular digraphs
- Thin weakly distance-regular digraphs
- Weakly distance-regular circulants. I
- Weakly distance-regular digraphs
- Weakly distance-regular digraphs of one type of arcs
- Weakly distance-regular digraphs of valency three, II
- Weakly distance-regular digraphs of valency three. I
- Weakly distance-regular digraphs whose underlying graphs are distance-regular. I
Cited in
(3)
This page was built for publication: Semicomplete multipartite weakly distance-regular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889288)