On the enumeration of certain sets of planted plane trees
β Scribed by I.Z Chorneyko; S.G Mohanty
- Publisher
- Elsevier Science
- Year
- 1975
- Tongue
- English
- Weight
- 651 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this
Let NSET be the category of enumerated sets. I n the ER&OV book [l] a lot has been said about the following problems related to this category. Let S, , S, be two enumerated sets. What assumptions about these sets should we accept in order to find "good" (i.e. principal computable) enumeration of the
A specialized method is presented for listing all the spanning trees of the wheel, homeomorphs of the wheel, and certain cellular arrays. The procedure is a generalization of a known method of enumerating the trees of a suitably labeled ladder graph, and results in a direct listing of the trees with