Bijections of k-plane trees
| dc.contributor.author | Owino, Isaac. Okoth | |
| dc.date.accessioned | 2022-10-22T15:24:47Z | |
| dc.date.available | 2022-10-22T15:24:47Z | |
| dc.date.issued | 2022 | |
| dc.identifier.uri | https://repository.maseno.ac.ke/handle/123456789/5424 | |
| dc.description | https://pisrt.org/psrpress/j/odam/2022/1/bijections-of-k-plane-trees.pdf | en_US |
| dc.description.abstract | A k-plane tree is a tree drawn in the plane such that the vertices are labeled by integers in the set {1, 2, . . . , k}, the children of all vertices are ordered, and if (i, j) is an edge in the tree, where i and j are labels of adjacent vertices in the tree, then i + j ≤ k + 1. In this paper, we construct bijections between these trees and the sets of k-noncrossing increasing trees, locally oriented (k − 1)-noncrossing trees, Dyck paths, and some restricted lattice paths. | en_US |
| dc.publisher | Open journal of discrete Applied Mathematics | en_US |
| dc.subject | k-plane tree; k-noncrossing increasing tree; Locally oriented k-noncrossing trees; Dyck path; Lattice path. | en_US |
| dc.title | Bijections of k-plane trees | en_US |
| dc.type | Article | en_US |