BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS

您当前的位置：

首页 >

文章列表页 >

BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS

工程技术 | 更新时间：2026-01-21

- BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS
- BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS
- 新疆大学学报（自然科学版中英文） 1989年第2期
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：
  中图分类号：
- 纸质出版：1989
- 稿件说明：
移动端阅览
[1].BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS[J].新疆大学学报(自然科学版),1989(02):108.

BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1989, (2).
[1].BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS[J].新疆大学学报(自然科学版),1989(02):108. DOI：

BOUNDSOFTHELONGESTDIRECTEDCYCLELENGTHFORMINIMALSTRONGDIGRAPHS[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 1989, (2). DOI：

摘要

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.

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

references

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据