On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges

DOI10.1155/2019/8769428MaRDI QIDQ2298935zbMATH OpenOpenAlexFDO

Authors Xiaoxin Xu, Yanbin Sang, Yueliang Liang, Yubin Gao

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/8769428

Mathematics Subject Classification ID

Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12)

Review text

Summary: The Wiener index of a graph is defined as the sum of distances between all unordered pairs of its vertices. We found that finite steps of diameter-growing transformation relative to vertices can not always enable the Wiener index of a tree to increase sharply. In this paper, we provide a graph transformation named diameter-growing transformation relative to pendent edges, which increases Wiener index \(W(T)\) of a tree sharply after finite steps. Then, twenty-two trees are ordered by their Wiener indices, and these trees are proved to be the first twenty-two trees with the first up to sixteenth smallest Wiener indices.

Recommendations

• Ordering trees with given matching number by their Wiener indices
• scientific article; zbMATH DE number 2185797
• Variation of the Wiener index under tree transformations
• scientific article; zbMATH DE number 5619543
• Ordering trees by their Wiener indices

Cites work

• A class of trees and its Wiener index
• A note on the maximal Wiener index of trees with given number of vertices of maximum degree
• A sharp lower bound on Steiner Wiener index for trees with given diameter
• scientific article; zbMATH DE number 5619543 (Why is no real title available?)
• scientific article; zbMATH DE number 508964 (Why is no real title available?)
• scientific article; zbMATH DE number 6945760 (Why is no real title available?)
• Inverse problem on the Steiner Wiener index
• Maximizing Wiener index for trees with given vertex weight and degree sequences
• On maximum Wiener index of trees and graphs with given radius
• On ordinary and reverse Wiener indices of non-caterpillars
• On the Steiner hyper-Wiener index of a graph
• On Wiener and terminal Wiener index of graphs
• Ordering trees by their Wiener indices
• Ordering trees having small reverse Wiener indices
• Ordering trees with given matching number by their Wiener indices
• Terminal Wiener index
• The Steiner Wiener index of a graph
• The terminal Wiener index of trees with diameter or maximum degree.
• The Wiener index of random digital trees
• Wiener index of trees of given order and diameter at most 6
• Wiener index of trees: Theory and applications
• Wiener indices of balanced binary trees

Cited in

(2)

• Variation of the Wiener index under tree transformations
• scientific article; zbMATH DE number 2185797 (Why is no real title available?)

This page was built for publication: On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges

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