An upper bound for the number of spanning trees of a graph (Q1234299): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4770409 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4047574 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(76)80005-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994224017 / rank | |||
Normal rank | |||
Latest revision as of 10:10, 30 July 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
