The girth of a directed distance-regular graph

DOI10.1006/JCTB.1993.1028zbMATH Open0733.05044OpenAlexW2003216503MaRDI QIDQ810046FDOQ810046

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

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

zbMATH Keywords

digraphgirthdirected distance-regular graph

Mathematics Subject Classification ID

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

Cited In (9)

• Weakly distance-regular digraphs of valency three. I
• Two results concerning distance-regular directed graphs
• Title not available (Why is that?)
• Metric coset schemes revisited
• Minimum cuts of distance-regular digraphs
• Thin weakly distance-regular digraphs
• DISTANCE-REGULAR DIGRAPHS OF GIRTH 6
• \(P\)-polynomial weakly distance-regular digraphs
• 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)