Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs (Q5495059)
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 6323196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs |
scientific article; zbMATH DE number 6323196 |
Statements
Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs (English)
0 references
30 July 2014
0 references
Cartesian product graphs
0 references
spanning trees
0 references
number of spanning trees
0 references
inequality
0 references
0.825122058391571
0 references
0.8154051303863525
0 references
0.8103165030479431
0 references
