کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4654367 | 1632821 | 2009 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bijections for 2-plane trees and ternary trees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
According to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-plane tree which is a planted plane tree with each of its vertices colored with one of two colors and -free. The similarity of the enumeration between 2-plane trees and ternary trees leads us to build several bijections. Especially, we found a bijection between the set of 2-plane trees of n+1n+1 vertices with a black root and the set of ternary trees with nn internal vertices. We also give a combinatorial proof for a relation between the set of 2-plane trees of n+1n+1 vertices and the set of ternary trees with nn internal vertices.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 30, Issue 4, May 2009, Pages 969–985
Journal: European Journal of Combinatorics - Volume 30, Issue 4, May 2009, Pages 969–985
نویسندگان
Nancy S.S. Gu, Helmut Prodinger,