Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.
A. R. GILANI1, M. FAGHANI2,*
Suppose M is a molecule, G is its molecular graph and A = [aij] is the adjacency matrix of G. An Euclidean graph associated to M is defined by a weighted graph with the adjacency matrix D = [dij], where for i ≠ j dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for different nuclei. In this work a simple method is described, by means of which it is possible to calculate the automorphism group of weighted graphs. We apply this method to compute the symmetry of some fullerenes..
Topological symmetry, Fullerene.
A. R. GILANI, M. FAGHANI, An algorithm for computing symmetry of fullerenes, Optoelectronics and Advanced Materials - Rapid Communications, 4, 4, April 2010, pp.556-559 (2010).
Submitted at: Feb. 28, 2010
Accepted at: April 11, 2010
Optoelectronics and Advanced Materials - Rapid Communications
(2025): Impact Factor = 0.5 - Journal Citation Reports (Clarivate Analytics, 2026)
Active accounts were imported to the new platform and assigned a random password by default. In order to access your account you need to access the login page and go through the Lost Password dialog (involves the system sending you an email with instructions) in order to reset your password. This step is necessary as passwords are kept in hashed form and the new platform uses modern hashing algorithms incompatible with the previous ones.