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.
Recommendations
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- On distances in vertex-weighted trees
- The extremal values of the Wiener index of a tree with given degree sequence
- Extremal Wiener index of trees with given number of vertices of even degree
- scientific article; zbMATH DE number 7410891
Cited in
(13)- On distances in vertex-weighted trees
- Sum of weighted distances in trees
- Maximizing Wiener index for trees with given vertex weight and degree sequences
- Inverse problem on the Steiner Wiener index
- scientific article; zbMATH DE number 6945760 (Why is no real title available?)
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
- On the Wiener index, distance cospectrality and transmission-regular graphs
- The general Randić index of trees with given number of pendent vertices
- Trees with minimum weighted Szeged index
- An asymptotic relation between the wirelength of an embedding and the Wiener index
- Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
- Extremal graphs with respect to variable sum exdeg index via majorization
- scientific article; zbMATH DE number 7546725 (Why is no real title available?)
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)