An upper bound for the number of spanning trees of a graph (Q1234299): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:37, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound for the number of spanning trees of a graph |
scientific article |
Statements
An upper bound for the number of spanning trees of a graph (English)
0 references
1977
0 references