|
This article is cited in 1 scientific paper (total 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.
Received: 11.04.2000
Citation:
G. A. Karpunin, “Minimal Networks on the Regular $n$-Dimensional Simplex”, Mat. Zametki, 69:6 (2001), 854–865; Math. Notes, 69:6 (2001), 780–789
Linking options:
https://www.mathnet.ru/eng/mzm699https://doi.org/10.4213/mzm699 https://www.mathnet.ru/eng/mzm/v69/i6/p854
|
| Statistics & downloads: |
| Abstract page: | 454 | | Full-text PDF : | 217 | | References: | 119 | | First page: | 1 |
|