节点文献

BOUNDS OF THE LONGEST DIRECTED CYCLE LENGTH FOR MINIMAL STRONG DIGRAPHS

免费订阅

【Author】 Chen Zibo Zhang Fuji

【摘要】 <正> 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.

  • 【下载频次】3
节点文献中: 

本文链接的文献网络图示:

浏览历史:
下载历史: