An upper bound for the number of spanning trees of a graph (Q1234299): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Geoffrey R. Grimmett / rank | |||
Property / author | |||
Property / author: Geoffrey R. Grimmett / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4770409 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4047574 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 20:37, 12 June 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