Resistance distance in regular graphs

I. Lukovits, S. Nikolić, N. Trinajstić

Research output: Contribution to journalArticle

105 Citations (Scopus)

Abstract

This report considers the resistance distance as a recently proposed new intrinsic metric on (molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(GN) > R(KN), where GN denotes a connected graph containing N vertices and KN denotes a complete graph containing N vertices. The formulas to obtain the R for two classes of regular graphs (cycles and complete graphs) are derived. Numerical values of R for four Platonic molecules are also given. They ordered the considered Platonic solids as the icosahedron, the cube, the octahedron, and the tetrahedron according to complexity of their Schlegel graphs. This order agrees with those obtained by many other, frequently used descriptors.

Original languageEnglish
Pages (from-to)217-225
Number of pages9
JournalInternational Journal of Quantum Chemistry
Volume71
Issue number3
Publication statusPublished - 1999

Fingerprint

apexes
Molecules
tetrahedrons
cycles
molecules

ASJC Scopus subject areas

  • Physical and Theoretical Chemistry

Cite this

Lukovits, I., Nikolić, S., & Trinajstić, N. (1999). Resistance distance in regular graphs. International Journal of Quantum Chemistry, 71(3), 217-225.

Resistance distance in regular graphs. / Lukovits, I.; Nikolić, S.; Trinajstić, N.

In: International Journal of Quantum Chemistry, Vol. 71, No. 3, 1999, p. 217-225.

Research output: Contribution to journalArticle

Lukovits, I, Nikolić, S & Trinajstić, N 1999, 'Resistance distance in regular graphs', International Journal of Quantum Chemistry, vol. 71, no. 3, pp. 217-225.
Lukovits, I. ; Nikolić, S. ; Trinajstić, N. / Resistance distance in regular graphs. In: International Journal of Quantum Chemistry. 1999 ; Vol. 71, No. 3. pp. 217-225.
@article{b1e81f5bd4144cdba676ffe1c5fc62f1,
title = "Resistance distance in regular graphs",
abstract = "This report considers the resistance distance as a recently proposed new intrinsic metric on (molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(GN) > R(KN), where GN denotes a connected graph containing N vertices and KN denotes a complete graph containing N vertices. The formulas to obtain the R for two classes of regular graphs (cycles and complete graphs) are derived. Numerical values of R for four Platonic molecules are also given. They ordered the considered Platonic solids as the icosahedron, the cube, the octahedron, and the tetrahedron according to complexity of their Schlegel graphs. This order agrees with those obtained by many other, frequently used descriptors.",
author = "I. Lukovits and S. Nikolić and N. Trinajstić",
year = "1999",
language = "English",
volume = "71",
pages = "217--225",
journal = "International Journal of Quantum Chemistry",
issn = "0020-7608",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

TY - JOUR

T1 - Resistance distance in regular graphs

AU - Lukovits, I.

AU - Nikolić, S.

AU - Trinajstić, N.

PY - 1999

Y1 - 1999

N2 - This report considers the resistance distance as a recently proposed new intrinsic metric on (molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(GN) > R(KN), where GN denotes a connected graph containing N vertices and KN denotes a complete graph containing N vertices. The formulas to obtain the R for two classes of regular graphs (cycles and complete graphs) are derived. Numerical values of R for four Platonic molecules are also given. They ordered the considered Platonic solids as the icosahedron, the cube, the octahedron, and the tetrahedron according to complexity of their Schlegel graphs. This order agrees with those obtained by many other, frequently used descriptors.

AB - This report considers the resistance distance as a recently proposed new intrinsic metric on (molecular) graphs, and in particular, the sum R over resistance distances between all pairs of vertices is considered as a graph invariant. It has been proved that R(GN) > R(KN), where GN denotes a connected graph containing N vertices and KN denotes a complete graph containing N vertices. The formulas to obtain the R for two classes of regular graphs (cycles and complete graphs) are derived. Numerical values of R for four Platonic molecules are also given. They ordered the considered Platonic solids as the icosahedron, the cube, the octahedron, and the tetrahedron according to complexity of their Schlegel graphs. This order agrees with those obtained by many other, frequently used descriptors.

UR - http://www.scopus.com/inward/record.url?scp=0001658791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001658791&partnerID=8YFLogxK

M3 - Article

VL - 71

SP - 217

EP - 225

JO - International Journal of Quantum Chemistry

JF - International Journal of Quantum Chemistry

SN - 0020-7608

IS - 3

ER -