References
- Kroto, H. W., Heath, J. R., O’Brien, S. C., Curl, R. F., and Smalley, R. E. (1985). Nature, 318: 162−163.
- Kroto, H. W., Fichier, J. E., and Cox, D. E. (1993). The Fullerene. Taylor & Francis: New York, NY.
- Fowler, P. W., and Manolopoulos, D. E. (1995). An Atlas of Fullerenes. Taylor & Francis: Oxford, UK.
- Mani, P. (1971). Automorphismen von polyedrischen Graphen. Math. Annalen., 192: 279–303.
- Marušič, D. (1981). On vertex symmetric digraphs. Discrete Math., 36: 69–81.
- Marušič, D. (1983). Hamilonian circuits in Cayley graphs. Discrete Math., 46: 49–54.
- Kutnar, K., Marušič, D., and Janežič, D. (2010). Fullerenes via their automorphism groups. MATCH Commun. Math. Comput. Chem., 63: 267−282.
- Babai L. (1995) Automorphism Groups, Isomorphism, Reconstruction. In: Chapter 27 of the Handbook of Combinatorics, R. L. Graham, M. Grötschel, L. Lovász, editors, North Holland - Elsevier, Volume 2, pp. 1447–1540.
- Dixon, J. D., and Mortimer, B. (1996). Permutation Groups. Taylor & Francis: New York, NY.
- Fowler, P. W., Manolopoulos, D. E., Redmond, D. B., and Ryan, R. (1993). Possible symmetries of fullerenes structures. Chem. Phys. Lett., 202: 371–378.
- Koorepazan-Moftakhar, F., Ashrafi, A. R., Mehranian, Z., and Ghorbani, M. (2014). Automorphism group and fixing number of (3, 6)- and (4, 6)-fullerene graphs. Electron. Notes Discrete Math., 45: 113−120.
- Windows. (2002). HyperChem Package Release 7.5. Taylor & Francis.: Florida.
- Diudea, M. D., Ursu, O., and Cs, L. (2002). Nagy, TOPOCLUJ. Taylor & Francis: Cluj-Napoca, Romania.
- The GAP Team. (1997). Groups, Algorithms, and Programming, Taylor & Francis: Aachen, Germany.