Prüfer sequence
id:
pr-fer-sequence-305-8028806
title:
Prüfer sequence
text:
In combinatorial mathematics, the Prüfer sequence of a labeled tree is a unique sequence associated with the tree. The sequence for a tree on n vertices has length n − 2, and can be generated by a simple iterative algorithm. Prüfer sequences were first used by Heinz Prüfer to prove Cayley's formula in 1918.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Pr%C3%BCfer_sequence
date created:
date modified:
2023-05-25T14:26:35Z
main entity:
{"identifier":"Q1087829","url":"https://www.wikidata.org/entity/Q1087829"}
image:
fields total:
13
integrity:
13