Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
From MaRDI portal
Publication:5279986
zbMath1461.05056arXiv1502.01216MaRDI QIDQ5279986
Publication date: 19 July 2017
Full work available at URL: https://arxiv.org/abs/1502.01216
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Related Items (11)
An asymptotic relation between the wirelength of an embedding and the Wiener index ⋮ On the Wiener index, distance cospectrality and transmission-regular graphs ⋮ Inverse problem on the Steiner Wiener index ⋮ Sum of weighted distances in trees ⋮ The general Randić index of trees with given number of pendent vertices ⋮ Extremal graphs with respect to variable sum exdeg index via majorization ⋮ Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees ⋮ Maximizing Wiener index for trees with given vertex weight and degree sequences ⋮ Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs ⋮ Unnamed Item ⋮ On distances in vertex-weighted trees
This page was built for publication: Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
