A conjecture on Wiener indices in combinatorial chemistry

DOI10.1007/s00453-004-1097-yzbMath1088.05503OpenAlexW1965967814WikidataQ123167991 ScholiaQ123167991MaRDI QIDQ1882529

Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa

Publication date: 1 October 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1097-y

zbMATH Keywords

treepathGraph theoryWiener indexmolecular graphenumeratingCombinatorial chemistryefficient algorithms,Matrix searching

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Applications of graph theory to circuits and networks (94C15)

Related Items

A survey of the all-pairs shortest paths problem and its variants in graphs, Some remarks on inverse Wiener index problem, On Wiener inverse interval problem of trees, On the minimum average distance spanning tree of the hypercube