Minimal networks on the regular \(n\)-dimensional simplex

DOI10.1023/A:1010278314755zbMath0987.05061OpenAlexW119987166MaRDI QIDQ5961077

G. A. Karpunin

Publication date: 4 June 2002

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010278314755

zbMATH Keywords

Steiner problemtreessimplexminimal parametric networks

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items

Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$