The connectivity of the basis graph of a branching greedoid (Q4013425)
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: The connectivity of the basis graph of a branching greedoid |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The connectivity of the basis graph of a branching greedoid |
scientific article |
Statements
The connectivity of the basis graph of a branching greedoid (English)
0 references
27 September 1992
0 references
connectivity
0 references
\(k\)-connected graph
0 references
rooted directed multigraph
0 references
out-trees
0 references
basis graph
0 references
branching greedoid
0 references
minimum in-degree
0 references
0.94164693
0 references
0.8971591
0 references
0.8892267
0 references
0.88552475
0 references
0.87349564
0 references
0.8733086
0 references
0 references
0 references
0.86685055
0 references
