Title of article
A pairing of the vertices of ordered trees Original Research Article
Author/Authors
Seunghyun Seo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
7
From page
471
To page
477
Abstract
A combinatorial bijection of the terminal vertices (other than roots) of ordered (rooted plane) trees with the internal vertices (including roots) is described (for ordered trees with at least one edge).
Keywords
Leaves , Bijective proof , Catalan numbers , Dyck paths , Ordered trees
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949856
Link To Document