Distance-transitive and distance-regular digraphs

DOI10.1016/S0095-8956(81)80009-3MaRDI QIDQ1156143zbMATH OpenFDO

Authors Robert Mark Damerell

Publication date 1981

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

distance-transitive

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3762086 (Why is no real title available?)
• scientific article; zbMATH DE number 3570473 (Why is no real title available?)
• Coherent configurations. I: Ordinary representation theory
• Distance transitive digraphs
• Nonexistence of certain distance-transitive digraphs

Cited in

(25)

• Highly arc transitive digraphs
• Directed distance regular graphs with the Q-polynomial property
• Complex spherical codes with three inner products
• Deza digraphs
• Non-symmetric, metric, cometric association schemes are self-dual
• On nonsymmetric P- and Q-polynomial association schemes
• On the weak distance-regularity of Moore-type digraphs
• Weakly distance-regular digraphs of valency three. I
• Graph theory (algorithmic, algebraic, and metric problems)
• Nonexistence of certain distance-transitive digraphs
• Minimum arc-cuts of normally regular digraphs and Deza digraphs
• Minimum cuts of distance-regular digraphs
• Normally regular digraphs
• On explicit random-like tournaments
• Thin weakly distance-regular digraphs
• Directed strongly walk-regular graphs
• Characterization of eccentric digraphs
• On the \(G\)-matrices with entries and eigenvalues in \(Q(i)\)
• On the Spectrum of a Weakly Distance-Regular Digraph
• Certain distance-regular digraphs and related rings of characteristic 4
• \(P\)-polynomial weakly distance-regular digraphs
• Distance-regular digraphs of girth 4
• Weakly distance-regular digraphs.
• A spectral excess theorem for digraphs with normal Laplacian matrices
• A spectral excess theorem for normal 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)