A formula for the number of spanning trees of a multi-star related graph (Q293471)
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 formula for the number of spanning trees of a multi-star related graph |
scientific article; zbMATH DE number 6590806
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A formula for the number of spanning trees of a multi-star related graph |
scientific article; zbMATH DE number 6590806 |
Statements
A formula for the number of spanning trees of a multi-star related graph (English)
0 references
9 June 2016
0 references
combinatorial problems
0 references
spanning trees
0 references
multi-star graph
0 references
0.95731926
0 references
0.9412852
0 references
0.9267176
0 references
0.90741843
0 references
0.90604496
0 references
0.9025171
0 references
0.90251696
0 references
