On the enumeration of rooted trees with fixed size of maximal decreasing trees
From MaRDI portal
Publication:658069
Abstract: Let be the set of rooted labeled trees on . A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new refinement of , which is the set of rooted labeled trees whose maximal decreasing subtree has vertices.
Recommendations
Cites work
Cited in
(8)- A REFINEMENT FOR ORDERED LABELED TREES
- Runs in labelled trees and mappings
- Enumerations of vertices among all rooted ordered trees with levels and degrees
- A REFINED ENUMERATION OF p-ARY LABELED TREES
- Bijections on rooted trees with fixed size of maximal decreasing subtrees
- A remark on the enumeration of rooted labeled trees
- Enumeration of subtrees and BC-subtrees with maximum degree no more than \(k\) in trees
- Descent polynomials for labeled trees
This page was built for publication: On the enumeration of rooted trees with fixed size of maximal decreasing trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658069)