Estimates of Multiplicities of Irreducible Multitours of Some Binary Trees
Irreducible multitours of binary trees appear in the weight formula for minimal fillings of finite metric spaces. In this paper, it is proved that the multiplicity of an irreducible multitour does not exceed 2 for any binary tree with 3 mustaches and it does not exceed 4 for binary trees consisting of four so-called sprouts.
Authors
- O. S. Shcherbakov
Institutions
- Bauman Moscow State Technical University (RU)
Publication Details
- Journal
- Moscow University Mathematics Bulletin
- Published
- 2025-04-01
- DOI
- https://doi.org/10.3103/s0027132225700263
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00