An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph (Q1210232)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph |
scientific article |
Statements
An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph (English)
0 references
25 May 1993
0 references
strongly connected digraph
0 references
degree
0 references
diameter
0 references
connectivity
0 references
