The girth of a directed distance-regular graph

DOI10.1006/JCTB.1993.1028MaRDI QIDQ810046zbMATH OpenOpenAlexFDO

Authors Douglas A. Leonard, Kazumasa Nomura

Publication date 1992

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

Full work available at URL https://doi.org/10.1006/jctb.1993.1028

zbMATH Keywords

digraphgirthdirected distance-regular graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Paths and cycles (05C38)

Recommendations

• Two results concerning distance-regular directed graphs
• Distance-regular graphs with girth 3 or 4: I
• scientific article; zbMATH DE number 2192091
• DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
• Distance-regular digraphs of girth 4

Cited in

(9)

• DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
• Weakly distance-regular digraphs of valency three. I
• Weakly distance-regular digraphs.
• Minimum cuts of distance-regular digraphs
• Metric coset schemes revisited
• scientific article; zbMATH DE number 1014801 (Why is no real title available?)
• \(P\)-polynomial weakly distance-regular digraphs
• Two results concerning distance-regular directed graphs
• Thin weakly distance-regular digraphs

This page was built for publication: The girth of a directed distance-regular graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810046)