摘要
An automorphism of the graph X is a bijection on which preserves the edge set. By a (x,6) fullerene graph, we mean a fulleroid graph composed of x-gonal and hexagonal faces which satisfies in the Euler's theorem. The aim of this paper is to report the automorphism group of some fulleroid graphs such as fullerene graphs. We also determine the size of automorphism group of some fullerenes.
- 出版日期2018