Computing Orbits of Big Fullerenes
Corresponding Author(s) : ALI REZA ASHRAFI
ashrafi@kashanu.ac.ir
Asian Journal of Chemistry,
Vol. 20 No. 1 (2008): Vol 20 Issue 1
Abstract
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 elucidean distance between the nuclei i and j. In this matrix dij can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. In this paper the symmetry of the big fullerene C320 with point group symmetry Ih together with its orbits is computed.
Keywords
Elucidean graph
Symmetry
Fullerene
YAVARI, M., & REZA ASHRAFI, A. (2010). Computing Orbits of Big Fullerenes. Asian Journal of Chemistry, 20(1), 409–416. Retrieved from https://asianpubs.org/index.php/ajchem/article/view/19424
Download Citation
Endnote/Zotero/Mendeley (RIS)BibTeX