Minimizing Wiener index for vertex-weighted trees with given weight and degree sequences

From MaRDI portal
Publication:5279986




Abstract: In 1997 Klavv{z}ar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be the, so-called, Huffman tree built in a bottom-up manner by sequentially connecting vertices of the least weights.









This page was built for publication: Minimizing Wiener index for vertex-weighted trees with given weight and degree sequences

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