Enumerations of vertices among all rooted ordered trees with levels and degrees

DOI10.1016/J.DISC.2017.04.007MaRDI QIDQ2359955zbMATH OpenOpenAlexFDO

Authors Sen-Peng Eu, Heesung Shin, Seung-Hyun Seo

Publication date 23 June 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.00715

zbMATH Keywords

degreeenumerationlevelrooted ordered tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Enumeration in graph theory (05C30)

Abstract: In this paper we enumerate and give bijections for the following four sets of vertices among rooted ordered trees of a fixed size: (i) first-children of degree $k$ at level $ell$, (ii) non-first-children of degree $k$ at level $ell-1$, (iii) leaves having $k-1$ elder siblings at level $ell$, and (iv) non-leaves of outdegree $k$ at level $ell-1$. Our results unite and generalize several previous works in the literature.

Recommendations

• Refined enumeration of vertices among all rooted ordered \(d\)-trees
• scientific article; zbMATH DE number 468836
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• scientific article; zbMATH DE number 4025461
• A remark on the enumeration of rooted labeled trees

Cites work

• A survey of the Fine numbers
• scientific article; zbMATH DE number 1439405 (Why is no real title available?)
• Odd or even on plane trees
• On the enumeration of rooted trees with fixed size of maximal decreasing trees
• The butterfly decomposition of plane trees
• The uplift principle for ordered trees

Cited in

(12)

• Counting vertices with given outdegree in plane trees and \(k\)-ary trees
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• Two bijections on weakly increasing trees
• A symmetry on parking functions via Dyck paths
• About half the middle binomial coefficient
• A statistic related to trees and words on a finite alphabet
• scientific article; zbMATH DE number 3882449 (Why is no real title available?)
• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• scientific article; zbMATH DE number 4025461 (Why is no real title available?)
• Refined enumeration of vertices among all rooted ordered \(d\)-trees
• A pairing of the vertices of ordered trees
• More bijective combinatorics of weakly increasing trees

This page was built for publication: Enumerations of vertices among all rooted ordered trees with levels and degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359955)