A Gray Code of Ordered Trees
Discrete Mathematics
2022-08-01 v5
Abstract
A combinatorial Gray code for a set of combinatorial objects is a sequence of all combinatorial objects in the set so that each object is derived from the preceding object by changing a small part. In this paper we design a Gray code for ordered trees with n vertices such that each ordered tree is derived from the preceding ordered tree by removing a leaf then appending a leaf elsewhere. Thus the change is just remove-and-append a leaf, which is the minimum.
Keywords
Cite
@article{arxiv.2207.01129,
title = {A Gray Code of Ordered Trees},
author = {Shin-ichi Nakano},
journal= {arXiv preprint arXiv:2207.01129},
year = {2022}
}
Comments
14 pages