On Wiener inverse interval problem of trees
From MaRDI portal
Abstract: The Wiener index W(G) of a simple connected graph G is defined as the sum of distances over all pairs of vertices in a graph. We denote by W[T_{n}] the set of all values of Wiener index for a graph from class T_{n} of trees on n vertices. The largest interval of contiguous integers (contiguous even integers in case of odd n) is denoted by W^{int}[T_{n}]. In this paper we prove that both sets are of the cardinality (1/6)n^3+O(n^2) in the case of even n, while in the case of odd n we prove that the cardinality of both sets equals (1/(12))n^3+O(n^2) solving thus two conjectures posed in literature.
Recommendations
Cites work
- A class of trees and its Wiener index
- A conjecture on Wiener indices in combinatorial chemistry
- A survey on graphs extremal with respect to distance-based topological indices
- All but 49 numbers are Wiener indices of trees
- scientific article; zbMATH DE number 912429 (Why is no real title available?)
- Mathematical aspects of Wiener index
- Molecular graphs and the inverse Wiener index problem
- On the parity of the Wiener index
- On Wiener inverse interval problem
- Wiener index of trees: Theory and applications
Cited in
(12)- On the parity of the Wiener index
- Trees and generalised inverse limits on intervals
- On roots of Wiener polynomials of trees
- A class of trees and its Wiener index
- Inverted distance and inverted Wiener index
- Computing the Wiener index of graphs on triples
- p-Wiener intervals and p-Wiener free intervals
- Some remarks on inverse Wiener index problem
- On Wiener inverse interval problem
- Reverse Wiener spectral radius of trees
- A note on the parity of integer-valued topological indices
- The inverse problem for certain tree parameters
This page was built for publication: On Wiener inverse interval problem of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615050)