Enumeration of multipartite series-reduced trees
Combinatorics
2025-12-22 v1
Abstract
We obtain a generating function for the degree sequences and colors of rooted multipartite labeled series-reduced trees. As an application of this result, we determine the number of symbolic ultrametrics (introduced by B\"ocker and Dress) and increasingly labeled processes. We also find that the number of multipartite labeled series-reduced trees and the colored chain-increasing binary trees are the same. We obtain the number of rooted multipartite unlabeled series-reduced trees. We also find a refinement of the result of Riordan and Shannon.
Keywords
Cite
@article{arxiv.2512.17216,
title = {Enumeration of multipartite series-reduced trees},
author = {Medet Jumadildayev},
journal= {arXiv preprint arXiv:2512.17216},
year = {2025}
}