Balance vertices in trees

DOI10.1002/(SICI)1097-0037(199912)34:4%3C264::AID-NET5%3E3.0.CO;2-AzbMATH Open0968.05028OpenAlexW2160869369MaRDI QIDQ4934869FDOQ4934869

Authors: K. B. Reid 

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199912)34:4%3C264::aid-net5%3E3.0.co;2-a

Recommendations

• Balance in trees
• A linear time algorithm for balance vertices on trees
• A note on balance vertices in trees
• Centroids to centers in trees
• Centroid, leaf-centroid, and internal-centroid

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)

Cites Work

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

Cited In (8)

• Hardy-Littlewood-Polya's inequality and a new concept of weak majorization
• The weight balance function on trees
• Some remarks on convex network flows for \(K\)-spiders
• Title not available (Why is that?)
• A note on balance vertices in trees
• A linear time algorithm for balance vertices on trees
• Total distance, Wiener index and opportunity index in wreath products of star graphs
• Balance in trees

This page was built for publication: Balance vertices in trees

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