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

DOI10.1070/SM8746zbMath1368.05137MaRDI QIDQ5349063

I. M. Nikonov, D. P. Il'yutko

Publication date: 23 August 2017

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: http://iopscience.iop.org/article/10.1070/SM8746

zbMATH Keywords

networkSteiner tree problemnormed planelocally minimal networkextremal network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Geometry and structure of normed linear spaces (46B20)

Related Items (1)

Modeling of optimal networks by means of linkages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locally minimal uniformly oriented shortest networks
• Locally minimal trees in \(n\)-normed spaces
• Steiner minimal trees for regular polygons
• How to find Steiner minimal trees in Euclidean \(d\)-space
• Branching extremals of the functional of $ \lambda$-normed length
• On Steiner Minimal Trees with Rectilinear Distance
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• An analogue of Morse theory for planar linear networks and the generalized Steiner problem
• The local Steiner problem in normed planes
• On Steiner’s Problem with Rectilinear Distance
• The Steiner Minimal Tree problem in the λ-geometry plane
• Minimal networks on the regular \(n\)-dimensional simplex

This page was built for publication: Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$