Abstract: The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on the maximal Wiener index of trees with a given degree sequence. This note proves one of the two conjectures and disproves the other.
Recommendations
Cited in
(17)- Counterexamples to conjectures on graph distance measures based on topological indexes
- Graphs with a given diameter that maximise the Wiener index
- Proof of a conjecture on the Wiener index of Eulerian graphs
- Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction
- A class of trees and its Wiener index
- The Steiner Wiener index of a graph
- Equiseparability on terminal Wiener index
- Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids
- scientific article; zbMATH DE number 7414737 (Why is no real title available?)
- Disproof of a conjecture on the minimum Wiener index of signed trees
- Note on the Product of Wiener and Harary Indices
- Orientations of graphs with maximum Wiener index
- A survey of recent extremal results on the Wiener index of trees
- The Nordhaus-Gaddum-type inequality for the Wiener polarity index
- Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems
- The maximum Wiener index of maximal planar graphs
- On ordinary and reverse Wiener indices of non-caterpillars
This page was built for publication: On the two conjectures of the Wiener index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408302)
