Bounds of the longest directed cycle length for minimal strong digraphs

Zhi bo Chen; Fu ji Zhang

doi:10.1016/0012-365X(88)90037-4

Bounds of the longest directed cycle length for minimal strong digraphs

Zhi bo Chen, Fu ji Zhang

Penn State Greater Allegheny

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strong 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.

Original language	English (US)
Pages (from-to)	9-13
Number of pages	5
Journal	Discrete Mathematics
Volume	68
Issue number	1
DOIs	https://doi.org/10.1016/0012-365X(88)90037-4
State	Published - 1988

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(88)90037-4

Cite this

@article{4727ffaba56d416fb6431fd4be2d73d4,

title = "Bounds of the longest directed cycle length for minimal strong digraphs",

abstract = "In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strong 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.",

author = "Chen, {Zhi bo} and Zhang, {Fu ji}",

year = "1988",

doi = "10.1016/0012-365X(88)90037-4",

language = "English (US)",

volume = "68",

pages = "9--13",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Bounds of the longest directed cycle length for minimal strong digraphs

AU - Chen, Zhi bo

AU - Zhang, Fu ji

PY - 1988

Y1 - 1988

N2 - In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strong 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.

AB - In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strong 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.

UR - http://www.scopus.com/inward/record.url?scp=45549112997&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45549112997&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(88)90037-4

DO - 10.1016/0012-365X(88)90037-4

M3 - Article

AN - SCOPUS:45549112997

SN - 0012-365X

VL - 68

SP - 9

EP - 13

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Bounds of the longest directed cycle length for minimal strong digraphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this