arXiv · 2611.16186
Counting doubly labelled trees and one-component networks
Abstract
A phylogenetic network is one-component if the child of every reticulation is a leaf. This class of networks has been widely used as building blocks in the combinatorial study of phylogenetic networks. We establish a bijection between one-component networks on $k$ taxa and rooted binary multi-labelled trees in which every label occurs exactly twice. Using this bijection and Burnside's lemma, we derive a closed formula and a two-term recurrence for the number of one-component networks. We further obtain explicit formulas for counting one-component networks with a prescribed number of reticulations.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Louxin Zhang. 2026-11-12. Counting doubly labelled trees and one-component networks. https://searcharxiv.com/abs/2611.16186
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.