On the Symmetry of a Zig-Zag and an Armchair Polyhex Carbon Nanotorus
A 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 weigh...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2009-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/1/2/145/ |
| Summary: | A 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 carbon nanotorus. We prove that this group is a semidirect product of a dihedral group by a group of order 2. |
|---|---|
| ISSN: | 2073-8994 |