|
|
|
|
enumeration of k-noncrossing trees and forests
|
|
|
|
|
|
|
|
نویسنده
|
okoth isaac owino
|
|
منبع
|
communications in combinatorics and optimization - 2022 - دوره : 7 - شماره : 2 - صفحه:301 -311
|
|
چکیده
|
A k-noncrossing tree is a noncrossing tree where each node receives a label in {1,2,…,k} such that the sum of labels along an ascent does not exceed k+1, if we consider a path from a fixed vertex called the root. in this paper, we provide a proof for a formula that counts the number of k-noncrossing trees in which the root (labelled by k) has degree d. we also find a formula for the number of forests in which each component is a k-noncrossing tree whose root is labelled by k.
|
|
کلیدواژه
|
k-noncrossing tree ,degree ,forest
|
|
آدرس
|
maseno university, school of mathematics, department of pure and applied mathematics, kenya
|
|
پست الکترونیکی
|
ookoth@maseno.ac.ke
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|