Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
labeled trees
|
| gptkbp:field |
graph theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cayley's formula
|
| gptkbp:namedAfter |
gptkb:Arthur_Cayley
|
| gptkbp:publicationYear |
1889
|
| gptkbp:publishedIn |
gptkb:Quarterly_Journal_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Kirchhoff's_theorem
gptkb:Prüfer_sequence spanning trees |
| gptkbp:state |
The number of labeled trees with n vertices is n^(n-2)
|
| gptkbp:usedIn |
gptkb:network_protocol
enumerative combinatorics |
| gptkbp:bfsParent |
gptkb:Arthur_Cayley
|
| gptkbp:bfsLayer |
5
|