The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an n-vertex maximal planar graph is at most \lfloor\frac{1}{18}(n^3+3n^2)\rfloor.
Dec 5, 2019
Oct 3, 2020 · The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the ...
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an ...
Since then, it has been one of the most frequently used topological indices in chemistry, as molecular structures are usually modelled as undirected graphs.
This paper determines the unique n -vertex maximal planar graph attaining this maximum, for every n ≥ 10, and proves the Wiener index is the sum of the ...
Dec 5, 2019 · It has been shown explicitly that the Wiener index is attained for the maximal planar graphs. Tn, we will give the construction of Tn in the ...
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a ...
Downloadable (with restrictions)! The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph.
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an ...
Nov 13, 2023 · Abstract: Abstract The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was ...