Distance-transitive and distance-regular digraphs
From MaRDI portal
Publication:1156143
DOI10.1016/S0095-8956(81)80009-3zbMath0468.05034MaRDI QIDQ1156143
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)
Related Items (25)
Characterization of eccentric digraphs ⋮ Weakly distance-regular digraphs of valency three. I ⋮ Thin weakly distance-regular digraphs ⋮ Minimum arc-cuts of normally regular digraphs and Deza digraphs ⋮ Certain distance-regular digraphs and related rings of characteristic 4 ⋮ Distance-regular digraphs of girth 4 ⋮ Directed strongly walk-regular graphs ⋮ Highly arc transitive digraphs ⋮ Minimum cuts of distance-regular digraphs ⋮ Normally regular digraphs ⋮ \(P\)-polynomial weakly distance-regular digraphs ⋮ Nonexistence of certain distance-transitive digraphs ⋮ Weakly distance-regular digraphs. ⋮ Non-symmetric, metric, cometric association schemes are self-dual ⋮ On nonsymmetric \(P\)- and \(Q\)-polynomial association schemes ⋮ A spectral excess theorem for normal digraphs ⋮ On the \(G\)-matrices with entries and eigenvalues in \(Q(i)\) ⋮ Complex spherical codes with three inner products ⋮ Deza digraphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A spectral excess theorem for digraphs with normal Laplacian matrices ⋮ On explicit random-like tournaments ⋮ On the weak distance-regularity of Moore-type digraphs ⋮ Directed distance regular graphs with the Q-polynomial property ⋮ On the Spectrum of a Weakly Distance-Regular Digraph
Cites Work
This page was built for publication: Distance-transitive and distance-regular digraphs
