Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph (Q3584204)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5775506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing the number of acyclic and totally cyclic orientations with that of spanning trees of a graph |
scientific article; zbMATH DE number 5775506 |
Statements
27 August 2010
0 references
Smarandache \(k\)-tree
0 references
Smarandache \(k\)-orientation
0 references
Tutte polynomial
0 references
spanning tree
0 references
acyclic orientation
0 references
0.8004605174064636
0 references
0.7652677297592163
0 references
0.7642465233802795
0 references
0.7252796292304993
0 references
