Counting spanning trees of \((1, N\))-periodic graphs (Q6180568)
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 7781868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting spanning trees of \((1, N\))-periodic graphs |
scientific article; zbMATH DE number 7781868 |
Statements
Counting spanning trees of \((1, N\))-periodic graphs (English)
0 references
22 December 2023
0 references
spanning trees
0 references
\((1, N\))-periodic graphs
0 references
rotational symmetry
0 references
matrix-tree theorem
0 references
Schur complement
0 references
0 references
0 references
0 references
0.8310558199882507
0 references
0.8028236031532288
0 references
0.8027603626251221
0 references
0.7984212636947632
0 references
0.7958869338035583
0 references
