Abstract <p>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.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Estimates of Multiplicities of Irreducible Multitours of Some Binary Trees

  • O. S. Shcherbakov

摘要

Abstract

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.