The diameter of directed graphs (Q1775900): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998859964 / rank | |||
Normal rank | |||
Revision as of 13:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The diameter of directed graphs |
scientific article |
Statements
The diameter of directed graphs (English)
0 references
4 May 2005
0 references
Let \(D\) be a strongly connected Eulerian oriented graph with \(n\) vertices and minimum out-degree \(\delta\). The author shows that the diameter of \(D\) is at most \(4n/(2\delta+ 1)+ 2\). This bound, which strengthens an earlier bound by \textit{A. V. Knyazev} [Mat. Zametki 41, 829--843, 891 (1987; Zbl 0698.05045)], is sharp apart from an additive constant.
0 references
Distance
0 references
Eulerian
0 references
Minimum degree
0 references
Oriented graph
0 references
