A note on Pr\"{u}fer--like coding and counting forests of uniform hypertrees

Abstract : This note presents an encoding and a decoding algorithms for a forest of (la- belled) 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ü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.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

Contributor : Christian Lavault <>
Submitted on : Monday, November 18, 2013 - 6:21:23 PM
Last modification on : Thursday, February 7, 2019 - 5:50:40 PM
Document(s) archivé(s) le : Saturday, April 8, 2017 - 1:31:11 AM


Files produced by the author(s)


  • HAL Id : hal-00905902, version 1



Christian Lavault. A note on Pr\"{u}fer--like coding and counting forests of uniform hypertrees. Journal of Discrete Algorithms, Elsevier, 2012, 12 (1), 29--36 (selected paper of ACiD 2010). ⟨hal-00905902⟩



Record views


Files downloads