All but 49 numbers are Wiener indices of trees
From MaRDI portal
Publication:2509156
DOI10.1007/s10440-006-9037-2zbMath1101.05027OpenAlexW2052459528MaRDI QIDQ2509156
Publication date: 18 October 2006
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-006-9037-2
Related Items (15)
The maximum Wiener index of maximal planar graphs ⋮ On an extremal inverse problem in graph theory ⋮ Inverse problem for Zagreb indices ⋮ Inverse problem on the Steiner Wiener index ⋮ Solving the Mostar index inverse problem ⋮ Some remarks on inverse Wiener index problem ⋮ On Wiener inverse interval problem of trees ⋮ Complexity of splits reconstruction for low-degree trees ⋮ Some new results on distance-based graph invariants ⋮ A formula with its applications on the difference of Zagreb indices of graphs ⋮ The inverse problem for certain tree parameters ⋮ On the Wiener index of graphs ⋮ The Steiner \(k\)-Wiener index of graphs with given minimum degree ⋮ Molecular graphs and the inverse Wiener index problem ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations
Uses Software
Cites Work
This page was built for publication: All but 49 numbers are Wiener indices of trees