Distance-transitive and distance-regular digraphs
From MaRDI portal
Cites work
Cited in
(26)- Certain distance-regular digraphs and related rings of characteristic 4
- Distance-regular digraphs of girth 4
- Highly arc transitive digraphs
- Nonexistence of certain distance-transitive digraphs
- Non-symmetric, metric, cometric association schemes are self-dual
- On nonsymmetric P- and Q-polynomial association schemes
- On the G-matrices with entries and eigenvalues in Q(i)
- Weakly distance-regular digraphs.
- Directed strongly walk-regular graphs
- Thin weakly distance-regular digraphs
- Complex spherical codes with three inner products
- On explicit random-like tournaments
- Minimum arc-cuts of normally regular digraphs and Deza digraphs
- Minimum cuts of distance-regular digraphs
- Deza digraphs
- Weakly distance-regular digraphs of valency three. I
- On the Spectrum of a Weakly Distance-Regular Digraph
- A spectral excess theorem for normal digraphs
- A spectral excess theorem for digraphs with normal Laplacian matrices
- On the weak distance-regularity of Moore-type digraphs
- Graph theory (algorithmic, algebraic, and metric problems)
- \(P\)-polynomial weakly distance-regular digraphs
- On the combinatorial structure and algebraic characterizations of distance-regular digraphs
- Directed distance regular graphs with the Q-polynomial property
- Characterization of eccentric digraphs
- Normally regular digraphs
This page was built for publication: Distance-transitive and distance-regular digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156143)