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. ASHRAFI1, M. GHORBANI1,*
Let G be a molecular graph. The distance d(u,v) between two vertices u and v of G is the minimum length of the paths connecting them. The greatest distance between any two vertices of G called the diameter of G. In this paper the diameter of two infinite families of fullerenes are computed.
Fullerene, Molecular graph, Diameter, Distance matrix.
A. R. ASHRAFI, M. GHORBANI, Distance matrix and diameter of two infinite family of fullerenes, Optoelectronics and Advanced Materials - Rapid Communications, 3, 6, June 2009, pp.596-599 (2009).
Submitted at: May 4, 2009
Accepted at: June 15, 2009
Optoelectronics and Advanced Materials - Rapid Communications
(2023): 0.5 - 2023 Journal Citation Reports (Clarivate Analytics, 2024)
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.