Show simple item record

dc.contributor.authorNyariaro, Albert Oloo
dc.contributor.authorOkoth, Isaac Owino
dc.date.accessioned2024-11-12T15:55:00Z
dc.date.available2024-11-12T15:55:00Z
dc.date.issued2024-08-18
dc.identifier.urihttps://repository.maseno.ac.ke/handle/123456789/6224
dc.description.abstractA k-plane tree is an ordered tree in which the vertices are labelled by integers {1, 2, . . . , k} and satisfies the condition i + j ⩽ k + 1 where i and j are adjacent vertices in the tree. These trees are known to be counted by Fuss-Catalan numbers. In this paper, we use generating functions and decomposition of trees to enumerate these trees according to degree of the root, label of the first child of the root and number of forests of k-plane trees. The results of this paper generalize known results for 2-plane trees and plane trees.en_US
dc.publisherGhaem Technology Institute of Higher Educationen_US
dc.subjectk-plane tree, degree, first child, forest.en_US
dc.titleEnumeration of k-plane trees and forestsen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record