An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:32, 1 February 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
