Majorization and distances in trees

DOI10.1002/net.20202zbMath1133.05025OpenAlexW4240651305MaRDI QIDQ5434592

Geir Dahl

Publication date: 7 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20202

zbMATH Keywords

distancescentertreesmajorization

Mathematics Subject Classification ID

Trees (05C05) Discrete location and assignment (90B80) Distance in graphs (05C12)

Related Items (6)

Hardy-Littlewood-Polya's inequality and a new concept of weak majorization ⋮ Some remarks on convex network flows for \(K\)-spiders ⋮ Majorization on \(\ell^\infty\) and on its closed linear subspace \(\mathfrak c\), and their linear preservers ⋮ Combinatorial Perron parameters for trees ⋮ Facility location with tree topology and radial distance constraints ⋮ Characterizations of majorization on summable sequences

Cites Work

• Unnamed Item
• Geometry of cuts and metrics
• Inequalities: theory of majorization and its applications

This page was built for publication: Majorization and distances in trees