Symmetry of a Capped Nanotube

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. In this paper, using the Computer Algebra System GAP, we calculate the automorphism group symmetry of a capped nanotube.