A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture (Q2519841)
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: A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture |
scientific article |
Statements
A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture (English)
0 references
27 January 2009
0 references
minimum in-degree
0 references
minimum out-degree
0 references
oriented graph
0 references
tournament
0 references
vertex strong connectivity
0 references
diameter
0 references
0.91747284
0 references
0.8915893
0 references
0.8897958
0 references
0.8843959
0 references
0.88420093
0 references
