Local cover image
Local cover image
Image from Google Jackets

Some refined enumerations of hybrid binary trees

By: Contributor(s): Publication details: New Delhi Springer 2024Edition: Vol.55(1), MarDescription: 94-104pSubject(s): Online resources: In: Indian journal of pure and applied mathematicsSummary: A hybrid binary tree is a complete binary tree where each internal node is labeled with 1 or 2, but with no left (1, 1)-edges. In this paper, we consider enumeration of the set of hybrid binary trees according to the number of internal nodes and some other combinatorial parameters. We present enumerative results by giving Riordan arrays, bivariate generating functions, as well as closed formulas. As a consequence, we obtain some new combinatorial matrices, one of which is analogous to the Borel triangle. We also present a bijection between the set of all hybrid binary trees with n internal nodes and the set of generalized Schröder paths from (0, 0) to (2n, 0) which are consist of up steps , horizontal steps , down steps , and double up steps , and never travel below the x-axis.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Status Barcode
Articles Abstract Database Articles Abstract Database School of Engineering & Technology Archieval Section Not for loan 2024-1552
Total holds: 0

A hybrid binary tree is a complete binary tree where each internal node is labeled with 1 or 2, but with no left (1, 1)-edges. In this paper, we consider enumeration of the set of hybrid binary trees according to the number of internal nodes and some other combinatorial parameters. We present enumerative results by giving Riordan arrays, bivariate generating functions, as well as closed formulas. As a consequence, we obtain some new combinatorial matrices, one of which is analogous to the Borel triangle. We also present a bijection between the set of all hybrid binary trees with n internal nodes and the set of generalized Schröder paths from (0, 0) to (2n, 0) which are consist of up steps , horizontal steps , down steps , and double up steps , and never travel below the x-axis.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image
Share
Unique Visitors hit counter Total Page Views free counter
Implemented and Maintained by AIKTC-KRRC (Central Library).
For any Suggestions/Query Contact to library or Email: librarian@aiktc.ac.in | Ph:+91 22 27481247
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.