新疆大学学报(自然科学版)

1989, (02) 108

[打印本页] [关闭]
本期目录(Current Issue) | 过刊浏览(Past Issue) | 高级检索(Advanced Search)

BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS
BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS

摘要(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):

Email:

参考文献(References):

扩展功能
本文信息
服务与反馈
本文关键词相关文章
本文作者相关文章
中国知网
分享