✦ LIBER ✦

Bounds of the longest directed cycle length for minimal strong digraphs

✍ Scribed by Zhi-bo Chen; Fu-ji Zhang

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 532 KB
Volume: 68
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90037-4

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.