Prüfer's encoding and decoding

Prüfer sequence
336 Downloads
Updated 15 Oct 2014

View License

A simple code for Prüfer's encoding and decoding.
In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) 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.
For more informations see:
http://en.wikipedia.org/wiki/Pr%C3%BCfer_sequence

Cite As

MOHAMMEDI RIDHA DJAMEL (2024). Prüfer's encoding and decoding (https://www.mathworks.com/matlabcentral/fileexchange/48108-prufer-s-encoding-and-decoding), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2010a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.1.0.0

link

1.0.0.0