论文信息 - COMPUTING THE SZEGED INDEX - 字舞流文

COMPUTING THE SZEGED INDEX

We give an explicit algorithm for computing the Szeged index of a graph which runs in ▫$O(mn)$▫ time, where ▫$n$▫ is the number of nodes and ▫$m$▫ is the number of edges.

Janez Žerovnik

[1] Sandi Klavzar,et al. An Algorithm for the Calculation of the Szeged Index of Benzenoid Hydrocarbons , 1995, J. Chem. Inf. Comput. Sci..

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] B. Mohar,et al. How to compute the Wiener index of a graph , 1988 .

[4] D. Rouvray. Predicting chemistry from topology. , 1986, Scientific American.

[5] N. Trinajstic. Chemical Graph Theory , 1992 .

[6] Tomaz Pisanski,et al. Weights on Edges of Chemical Graphs Determined by Paths , 1994, J. Chem. Inf. Comput. Sci..

[7] István Lukovits,et al. Correlation between components of the Wiener index and partition coefficients of hydrocarbons , 1992 .