Abstract: We introduce an inductively defined sequence of directed graphs and prove that the number of edges added at step is equal to the th Catalan number. Furthermore, we establish an isomorphism between the set of edges adjoined at step and the set of planar rooted trees with edges.
Recommendations
- Action graphs, rooted planar forests, and self-convolutions of the Catalan numbers
- Cuntz-Krieger algebras and a generalization of Catalan numbers
- Random graphs induced by Catalan pairs
- A determinant property of Catalan numbers
- Sur les polynômes de Catalan simples et doubles. (On simple and double Catalan polynomials)
Cited in
(6)- Three-dimensional Catalan numbers and product-coproduct prographs
- Random graphs induced by Catalan pairs
- Action graphs, rooted planar forests, and self-convolutions of the Catalan numbers
- Cuntz-Krieger algebras and a generalization of Catalan numbers
- Generalized Catalan sequences originating from the analysis of special data structures
- An application of Catalan numbers on Cayley tree of order 2: Single polygon counting
This page was built for publication: Action graphs and Catalan numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502219)