Pregled bibliografske jedinice broj: 36098
Resistance distance in regular graphs
Resistance distance in regular graphs // International journal of quantum chemistry, 71 (1999), 3; 217-225 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 36098 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Resistance distance in regular graphs
Autori
Lukovits, Istvan ; Nikolić, Sonja ; Trinajstić, Nenad
Izvornik
International journal of quantum chemistry (0020-7608) 71
(1999), 3;
217-225
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Sažetak
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(G(N)) > R(K-N), where G(N)
denotes a connected graph containing N vertices and K-N 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. (C) 1999 John Wiley & Sons, Inc.
Izvorni jezik
Engleski
Znanstvena područja
Kemija
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus