An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph (Q1210232)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph |
scientific article; zbMATH DE number 177982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An inequality relating the order, maximum degree, diameter and connectivity of a strongly connected digraph |
scientific article; zbMATH DE number 177982 |
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
0.8158742189407349
0 references
0.8065951466560364
0 references
0.8057459592819214
0 references
0.8027123808860779
0 references
