An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2009.11.033 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2009.11.033 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient approach for counting the number of spanning trees in circulant and related graphs |
scientific article |
Statements
An efficient approach for counting the number of spanning trees in circulant and related graphs (English)
0 references
27 April 2010
0 references
circulant graphs
0 references
counting the number of spanning trees
0 references
recurrence relations
0 references
0 references
