2015
DOI: 10.37236/5164
|View full text |Cite
|
Sign up to set email alerts
|

Locally Oriented Noncrossing Trees

Abstract: We define an orientation on the edges of a noncrossing tree induced by the labels: for a noncrossing tree (i.e., the edges do not cross) with vertices $1,2,\ldots,n$ arranged on a circle in this order, all edges are oriented towards the vertex whose label is higher. The main purpose of this paper is to study the distribution of noncrossing trees with respect to the indegree and outdegree sequence determined by this orientation. In particular, an explicit formula for the number of noncrossing trees with given i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…for the number of noncrossing trees on n vertices with i sources. This formula was first obtained by Okoth and Wagner in [5].…”
Section: Consequences Of the Main Theoremmentioning
confidence: 93%
See 1 more Smart Citation
“…for the number of noncrossing trees on n vertices with i sources. This formula was first obtained by Okoth and Wagner in [5].…”
Section: Consequences Of the Main Theoremmentioning
confidence: 93%
“…Vertex 3 is a white source while vertex 2 is a non-source white vertex. The number of noncrossing trees, having a local orientation, with a given number of sources and sinks was obtained by the present author and his co-author in [5]. These trees are called locally oriented noncrossing trees or lnc-trees therein.…”
Section: Introductionmentioning
confidence: 99%
“…In Figure 1, we show a plane Husimi graph on 11 vertices with 6 blocks. Plane Husimi graphs as well as other related structures have been extensively studied in [1,2,4,5,7,[9][10][11][12][13]16] among other papers. A block b attached to a vertex i in a plane Husimi graph is called a block child of i and the outdegree of a vertex j is the number of its block children [13].…”
Section: Definition 11 ( [12]mentioning
confidence: 99%