This article is cited in 1 paper

Minimal Networks on the Regular $n$-Dimensional Simplex

G. A. Karpunin

M. V. Lomonosov Moscow State University

Abstract: The paper gives the proof of the following fact: all simple, i.e., having no nodes of degree 2, trees that span the vertices of the regular $n$-dimensional simplex can be realized as nondegenerate minimal parametric networks.

UDC: 519.711.72

Received: 11.04.2000

DOI: 10.4213/mzm699

 English version: Mathematical Notes, 2001, 69:6, 780–789

Bibliographic databases:

• 
• 
• 
•