The computation of the distance matrix and the Wiener index for graphs of arbitrary complexity with weighted vertices and edges
- 9 January 1988
- journal article
- research article
- Published by Elsevier in Computers & Chemistry
- Vol. 12 (3) , 219-227
- https://doi.org/10.1016/0097-8485(88)85020-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Improving the flexible molecular fitting technique using distance matricesJournal of Computational Chemistry, 1986
- Discrimination and ordering of chemical structures by the number of walksTheoretical Chemistry Accounts, 1986
- Predicting Chemistry from TopologyScientific American, 1986
- Determination of the Wiener molecular branching index for the general treeJournal of Computational Chemistry, 1985
- A fast algorithm for calculation of the distance matrix of a moleculeJournal of Computational Chemistry, 1983
- Information theory, distance matrix, and molecular branchingThe Journal of Chemical Physics, 1977
- Vapor Pressure–Temperature Relationships Among the Branched Paraffin HydrocarbonsThe Journal of Physical Chemistry, 1948
- Correlation of Heats of Isomerization, and Differences in Heats of Vaporization of Isomers, Among the Paraffin HydrocarbonsJournal of the American Chemical Society, 1947
- Influence of Interatomic Forces on Paraffin PropertiesThe Journal of Chemical Physics, 1947
- Structural Determination of Paraffin Boiling PointsJournal of the American Chemical Society, 1947