How to compute the Wiener index of a graph

1988/07/01 by Bojan Mohar, Tomaž Pisanski · 86 citations
Chemistry · Computer Science · Mathematics · #Combinatorics #Computational Drug Discovery Methods #Computer science #Connectivity #Directed graph #Graph #Graph theory and applications #History and advancements in chemistry #Index (typography) #Mathematical chemistry #Mathematics #Topological index #Wiener index

paper · doi:10.1007/bf01167206

published in Journal of Mathematical Chemistry 2(3), 267-277 (Springer Science and Business Media LLC)

crossref issued 1988/07/01 · crossref published 1988/07/01 · crossref published-print 1988/07/01 · openalex publication_date 1988/07/01 · crossref created 2005/02/03 · crossref published-online 2005/02/04 · crossref deposited 2021/07/04 · openalex created_date 2025/10/10 · crossref indexed 2026/06/02 · openalex updated_date 2026/07/23

Citations

• An algorithm for construction of the molecular distance matrix
• Combinatorial optimization: networks and matroids
• Determination of the Wiener molecular branching index for the general tree
• A fast algorithm for calculation of the distance matrix of a molecule
• The normal boiling points and critical constants of saturated aliphatic hydrocarbons
• Structural Determination of Paraffin Boiling Points

Cited by

• Algorithms for graphs of bounded treewidth via orthogonal range searching
• Labeling of Benzenoid Systems which Reflects the Vertex-Distance Relations
• The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time
• Wiener index [wikipedia]