A short note on the number of spanning trees in lexicographics product of graphs (Q4604136)
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 short note on the number of spanning trees in lexicographics product of graphs |
scientific article; zbMATH DE number 6843234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short note on the number of spanning trees in lexicographics product of graphs |
scientific article; zbMATH DE number 6843234 |
Statements
23 February 2018
0 references
spanning tree
0 references
Laplacian spectrum
0 references
lexicographic product
0 references
matrix-tree theorem
0 references
0.8821428418159485
0 references
0.8257285356521606
0 references
0.825122058391571
0 references
0.8107082843780518
0 references
