z-logo
Premium
Resistance‐distance matrix: A computational algorithm and its application
Author(s) -
Babić D.,
Klein D. J.,
Lukovits I.,
Nikolić S.,
Trinajstić N.
Publication year - 2001
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.10057
Subject(s) - wiener index , distance matrix , vertex (graph theory) , combinatorics , quotient , matrix (chemical analysis) , mathematics , resistance distance , graph , chemistry , line graph , chromatography , graph power
The distance matrix D , the resistance‐distance matrix Ω , the related quotient matrices D / Ω and Ω / D and the corresponding distance‐related and resistance‐distance‐related descriptors: the Wiener index W, the Balaban indices J and J Ω , the Kirchhoff index Kf, the Wiener‐sum index WS, and Kirchhoff‐sum index KfS are presented. A simple algorithm for computing the resistance‐distance matrix is outlined. The distance‐related and the resistance‐distance‐related indices are used to study cyclicity in four classes of polycyclic graphs: five‐vertex graphs containing a five‐cycle and Schlegel graphs representing platonic solids, buckminsterfullerene isomers and C 70 isomers. Among the considered indices only the Kirchhoff index correctly ranks according to their cyclicity, the Schlegel graphs for platonic solids, C 60 isomers, and C 70 isomers. The Kirchhoff index further produces the reverse order of five‐vertex graphs containing a five‐cycle (which could be simply altered to the correct order by adding a minus sign to the Kirchhoff indices for these graphs). © 2001 John Wiley & Sons, Inc. Int J Quantum Chem, 2001

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom