The girth of a directed distance-regular graph

DOI10.1006/jctb.1993.1028zbMath0733.05044OpenAlexW2003216503MaRDI QIDQ810046

Douglas A. Leonard, Nomura, Kazumasa

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

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

Related Items (6)

Weakly distance-regular digraphs of valency three. I ⋮ Thin weakly distance-regular digraphs ⋮ Minimum cuts of distance-regular digraphs ⋮ \(P\)-polynomial weakly distance-regular digraphs ⋮ Weakly distance-regular digraphs. ⋮ Metric coset schemes revisited

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