On recursively defined combinatorial classes and labelled trees
Abstract
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2020
- DOI:
- arXiv:
- arXiv:2004.04203
- Bibcode:
- 2020arXiv200404203C
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Information Theory;
- 05C30;
- 05A19
- E-Print:
- 14 pages, 6 figures, accepted for presentation at the International Conference on Computers Communications and Control (ICCCC), May 2020