Computer Science – Discrete Mathematics
Scientific paper
2011-10-02
Computer Science
Discrete Mathematics
Version 2; 8th International Conference on Computer Science and Information Technologies (CSIT 2011), Erevan : Armenia (2011)
Scientific paper
This note presents an encoding and a decoding algorithms for a forest of (labelled) rooted uniform hypertrees and hypercycles in linear time, by using as few as $n - 2$ integers in the range $[1,n]$. It is a simple extension of the classical Pr\"{u}fer code for (labelled) rooted trees to an encoding for forests of (labelled) rooted uniform hypertrees and hypercycles, which allows to count them up according to their number of vertices, hyperedges and hypertrees. In passing, we also find Cayley's formula for the number of (labelled) rooted trees as well as its generalisation to the number of hypercycles found by Selivanov in the early 70's.
No associations
LandOfFree
A note on Prüfer-like coding and counting forests of uniform hypertrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A note on Prüfer-like coding and counting forests of uniform hypertrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on Prüfer-like coding and counting forests of uniform hypertrees will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-284505