The Girth of a Directed Distance-Regular Graph

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let G be a distance-regular digraph of short type, that is, with diameter d equal to g — 1 where g is the girth. Suppose the valency k > 1, so that G is not a directed cycle. Then the structure of Γ1(u) forces g ≤ 8. © 1993 by Academic Press, Inc.

Cite

CITATION STYLE

APA

Leonard, D. A., & Nomura, K. (1993). The Girth of a Directed Distance-Regular Graph. Journal of Combinatorial Theory, Series B, 58(1), 34–39. https://doi.org/10.1006/jctb.1993.1028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free