Answers are grounded in this paper and cite their sources.
This research introduces a new class of k-plane trees and enumerates properties concerning vertex labels and structure.
In this paper, we introduce a class of plane trees whose vertices receive labels from the set {1,2,...,k} such that the sum of labels of adjacent vertices does not exceed k+1 and all vertices of label 1 are always on the left of all other vertices. Using generating functions, we enumerate these trees by number of vertices and label of the root, root degree, label of the eldest or youngest child of the root and forests.
No takes yet. Share an insight, caveat, or question.
Oduol et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: