Majorization and distances in trees

DOI10.1002/NET.20202MaRDI QIDQ5434592zbMATH OpenOpenAlexFDO

Authors 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

centerdistancesmajorizationtrees

Mathematics Subject Classification ID

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

Recommendations

• On majorization of closed walk vectors of trees with given degree sequences
• Extermal trees with respect to some versions of Zagreb indices via majorization
• Majorization and the spectral radius of starlike trees
• On different ``middle parts of a tree
• Centroid, leaf-centroid, and internal-centroid

Cites work

• Geometry of cuts and metrics
• scientific article; zbMATH DE number 1194938 (Why is no real title available?)
• Inequalities: theory of majorization and its applications

Cited in

(11)

• Ordinal properties of tree distances
• Some remarks on convex network flows for \(K\)-spiders
• Combinatorial Perron parameters for trees
• Average distances on substitution trees
• Facility location with tree topology and radial distance constraints
• On majorization of closed walk vectors of trees with given degree sequences
• Hardy-Littlewood-Polya's inequality and a new concept of weak majorization
• Majorization on \(\ell^\infty\) and on its closed linear subspace \(\mathfrak c\), and their linear preservers
• Characterizations of majorization on summable sequences
• Sets of vertices with extremal energy
• Doubly stochastic matrices and modified Laplacian matrices of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434592)