摘要(Abstract)：

<正> In this paper we present the upper and lower bounds of the longestdirected cycle length for minimal stroug digraphs in terms of the numbers of verticesand arcs.These bounds are both sharp.In addition,we give analogous results forminmal 2-edge connected graphs.

关键词(KeyWords)：

Abstract:

Keywords:

基金项目(Foundation):

作者(Author):

参考文献(References)：