Maximizing Wiener index for trees with given vertex weight and degree sequences

DOI10.1016/j.amc.2017.07.077zbMath1426.05010arXiv1705.04291OpenAlexW2613260394MaRDI QIDQ1740236

Mikhail Goubko

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.04291

zbMATH Keywords

greedy algorithmoptimal caterpillarupper-bound estimateWiener index for graph with weighted vertices

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Distance in graphs (05C12) Signed and weighted graphs (05C22)

Related Items (9)

On transmission irregular starlike trees ⋮ Sum of weighted distances in trees ⋮ Maximum external Wiener index of graphs ⋮ Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees ⋮ Unnamed Item ⋮ The Wiener index of hypergraphs ⋮ On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges ⋮ On distances in vertex-weighted trees ⋮ Distance-based indices of complete m-ary trees

Cites Work

• The vertex version of weighted Wiener number for bicyclic molecular structures
• The Wiener maximum quadratic assignment problem
• Graphs with fixed number of pendent vertices and minimal zeroth-order general Randić index
• Terminal Wiener index
• The extremal values of the Wiener index of a tree with given degree sequence
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• Graphs with given degree sequence and maximal spectral radius
• Eigenvalues, diameter, and mean distance in graphs
• Wiener number of vertex-weighted graphs and a chemical application
• Wiener index versus maximum degree in trees
• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration
• A forgotten topological index
• Zagreb indices of graphs
• A new version of Zagreb indices
• Mathematical aspects of Wiener index
• An edge version of the matrix-tree theorem and the wiener index
• The distance spectrum of a tree
• Minimizing Wiener Index for Vertex-Weighted Trees with Given Weight and Degree Sequences
• Simple Alcohols with the Lowest Normal Boiling Point Using Topological Indices
• A Method for the Construction of Minimum-Redundancy Codes
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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