| dc.description.abstract | A 2-noncrossing tree is a connected graph without cycles that can be drawn in the
plane with its vertices on the boundary of circle such that the edges are straight line segments that
do not cross and all the vertices are coloured black and white with no ascent (i, j), where i and j
are black vertices, in a path from the root. In this paper, we use generating functions to prove a
formula that counts 2-noncrossing trees with a black root to take into account the number of white
vertices of indegree greater than zero and black vertices. Here, the edges of the 2-noncrossing
trees are oriented from a vertex of lower label towards a vertex of higher label. The formula is
a refinement of the formula for the number of 2-noncrossing trees that was obtained by Yan and
Liu and later on generalized by Pang and Lv. As a consequence of the refinement, we find an
equivalent refinement for 2-noncrossing trees with a white root, among other results | en_US |
