An iteration method for computing the total number of spanning trees and its applications in graph theory (Q1686071)
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 6820622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iteration method for computing the total number of spanning trees and its applications in graph theory |
scientific article; zbMATH DE number 6820622 |
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
0 references
0 references
0.7997676730155945
0 references
0.7828255891799927
0 references
0.7797473669052124
0 references
0.7794839143753052
0 references
