论文信息 - A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. In this paper an algorithm for constructing distance matrix of a zig-zag polyhex nanotube is introduced. As a consequence, the Wiener index of this nanotube is computed.

Shahram Yousefi | AliReza Ashrafi

[1] H. Wiener. Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[2] H. Hosoya. Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons , 1971 .

[3] Peter E. John,et al. Wiener index of zig-zag polyhex nanotubes , 2004 .

[4] I. Gutman,et al. Wiener Index of Hexagonal Systems , 2002 .

[5] I. Gutman,et al. Wiener Index of Trees: Theory and Applications , 2001 .

[6] Peter E. John,et al. Wiener index of armchair polyhex nanotubes , 2004 .

[7] Mircea V. Diudea. Wiener and Hyper-Wiener Numbers in a Single Matrix , 1996, J. Chem. Inf. Comput. Sci..

[8] Andrey A. Dobrynin. A Simple Formula for the Calculation of the Wiener Index of Hexagonal Chains , 1999, Comput. Chem..

[9] Robert L. Patten. Combinatorics: Topics, Techniques, Algorithms , 1995 .

[10] Roberto Todeschini,et al. Handbook of Molecular Descriptors , 2002 .

[11] Mircea V. Diudea,et al. Nanoporous Carbon Allotropes by Septupling Map Operations , 2005, J. Chem. Inf. Model..