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. AZAD1, M. GHORBANI1,*
Let G be a non-abelian group and let Z(G) be the center of G. We associate with G a graph ΓG as follows: Take G\Z(G) as vertices of ΓG and join two distinct vertices x and y whenever xy ≠ yx. The graph ΓG is called the noncommuting graph of G. In this paper we compute non – commuting graph of dihedral group D2n as a symmetry group of some fullerene graphs.
Fullerene, Non – commuting graphs, Conjugacy classes, Dihedral group.
A. AZAD, M. GHORBANI, Non – commuting graphs of group automorphism of an infinite family of fullerenes, Optoelectronics and Advanced Materials - Rapid Communications, 4, 8, August 2010, pp.1261-1263 (2010).
Submitted at: July 20, 2010
Accepted at: Aug. 12, 2010
Optoelectronics and Advanced Materials - Rapid Communications
(2024): Impact Factor = 0.4 - Journal Citation Reports (Clarivate Analytics, 2025)
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.