Counting doubly labelled trees and one-component networks

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16186
Primary Topic
Genomics and Phylogenetic Studies
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Counting doubly labelled trees and one-component networks

Louxin Zhang
arXiv (Cornell University)
Genomics and Phylogenetic Studies
preprint

Counting doubly labelled trees and one-component networks

Louxin Zhang
preprint en

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.

arXiv (Cornell University)
Genomics and Phylogenetic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon