Title of article
The Reduced Prüfer Code for Rooted Labelled k-Trees
Author/Authors
Costa Pereira، نويسنده , , P.R. and Markenzon، نويسنده , , L. and Vernet، نويسنده , , O.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
135
To page
139
Abstract
Based on the redundant Prüfer code for k-trees, developed by Rényi and Rényi, a more compact new encoding scheme is proposed and the one-to-one correspondence between both codes is proved.
Keywords
Codewords , k-trees , Prüfer code
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454108
Link To Document