An efficient approach for counting the number of spanning trees in circulant and related graphs (Q966019): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.11.033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2072070879 / rank | |||
Normal rank | |||
Revision as of 01:20, 20 March 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
