An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071): 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.tcs.2017.10.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767475077 / rank | |||
Normal rank | |||
Revision as of 00:31, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iteration method for computing the total number of spanning trees and its applications in graph theory |
scientific article |
Statements
An iteration method for computing the total number of spanning trees and its applications in graph theory (English)
0 references
20 December 2017
0 references
Brouwer's fixed-point theorem
0 references
algorithms
0 references
Cayley's theorem
0 references
number of spanning trees
0 references
ladder graph
0 references
wheel graph
0 references
