Mathematica MathWorld Wolfram Science More »

HOME

TOPICS

LATEST

Prüfer Codes of Labeled Trees


	In 1889, Cayley proved that there are labeled trees on nodes. In 1918, Prüfer found a method for constructing each tree. Consider the tree with code {2, 8, 9, 4, 7, 7, 2} that is given as the default tree in this Demonstration. The first digit of the Prüfer code is the branch that has the smallest isolated number. Pruning that branch gives a new tree, and the process repeats, as shown in the Details.


	Contributed by: Ed Pegg Jr

The smallest non-branch number is 1. Cut it from 2.
The smallest non-branch number is 3. Cut it from 8.
The smallest non-branch number is 5. Cut it from 9.
The smallest non-branch number is 6. Cut it from 4.
The smallest non-branch number is 4. Cut it from 7.
The smallest non-branch number is 8. Cut it from 7.
The smallest non-branch number is 7. Cut it from 2.

Prüfer Code (Wolfram MathWorld)

Labeled Tree (Wolfram MathWorld)

"Prüfer Codes of Labeled Trees" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/PruferCodesOfLabeledTrees/

Contributed by: Ed Pegg Jr

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom