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.
H. MAKTABI1, J. DAVOUDI2, M. GHORBANI3,*
Fullerene era was started with the discovery of stable cluster of C60 fullerene by Harry Kroto in 1895. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [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 distinct nuclei. The aim of this paper is to compute the automorphism group of the Euclidean graph of a big fullerene C180. We prove this fullerene graph is isomorphic with Ih point group.
Fullerene, Symmetry group, Permutation group.
H. MAKTABI, J. DAVOUDI, M. GHORBANI, Computing symmetry group of fullerene C80, Optoelectronics and Advanced Materials - Rapid Communications, 4, 4, April 2010, pp.550-552 (2010).
Submitted at: March 14, 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.