Enumeration for no-trivial spanning forests of complete bipartite graphs. (Q3115019)
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: Enumeration for no-trivial spanning forests of complete bipartite graphs. |
scientific article; zbMATH DE number 6007697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration for no-trivial spanning forests of complete bipartite graphs. |
scientific article; zbMATH DE number 6007697 |
Statements
20 February 2012
0 references
enumeration
0 references
no-trivial forest
0 references
complete bipartite graph
0 references
0.9163104295730592
0 references
0.8412830233573914
0 references
0.8264381885528564
0 references
0.8234712481498718
0 references
