Counting spanning trees in a complete bipartite graph which contain a given spanning forest (Q6081889)
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 7746499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting spanning trees in a complete bipartite graph which contain a given spanning forest |
scientific article; zbMATH DE number 7746499 |
Statements
Counting spanning trees in a complete bipartite graph which contain a given spanning forest (English)
0 references
5 October 2023
0 references
complete bipartite graph
0 references
multigraph
0 references
spanning tree
0 references
weighted graph
0 references
0 references
0 references
0.9314947128295898
0 references
0.8405629396438599
0 references
0.827894389629364
0 references
0.8264381885528564
0 references
