Balance vertices in trees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199912)34:4<264::AID-NET5>3.0.CO;2-A" /><264::AID-NET5>3.0.CO;2-A 10.1002/(SICI)1097-0037(199912)34:4<264::AID-NET5>3.0.CO;2-AzbMath0968.05028OpenAlexW2160869369MaRDI QIDQ4934869

K. Brooks Reid

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199912)34:4<264::aid-net5>3.0.co;2-a

zbMATH Keywords

treedistanceseccentricitybalance verticesbalanced bipartitions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Deterministic network models in operations research (90B10) 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 ⋮ A linear time algorithm for balance vertices on trees ⋮ Total distance, Wiener index and opportunity index in wreath products of star graphs ⋮ A note on balance vertices in trees ⋮ Balance in trees

Cites Work

• The \(k\)-ball \(l\)-path branch weight centroid

This page was built for publication: Balance vertices in trees