ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS
Keywords:
Fullerene, Cayley graph, finite groupAbstract
An (r, s)-fullerene graph is a planar 3-regular graph with only Cr and Cs faces, where Cn denotes a cycle of length n. In this paper, the (3,6)-fullerene Cayley graphs constructed from finite groups are classified. A characterization of (4,6)-fullerene Cayley graphs is also presented.
References
M.E. Conder, Quart. J. Math. Oxford, 1987, 38, 427.
H.H. Glover, D. Marusic, J. Eur. Math. Soc., 2007, 9, 775.
M.H. Kang, Discrete Math., 2011, 311, 2384.
P.W. Fowler, D.E. Manolopoulos, “An atlas of Fullerenes”, The Clarendon Press, Oxford, 1995.
The GAP Team, GAP, Groups, Algorithms and Programming, Lehrstuhl De für Mathematik, RWTH, Aachen, 1995.
B. Kostant, Notices of the AMS, 1995, 42, 959.
B. Kostant, Proc. Natl. Acad. Sci., 1994, 91, 11714.
B. Kostant, Selecta Mathematica, New Series, 1995, 1, 163.
H.W. Kroto, J.R. Heath, S.C. O’Brien, R.F. Curl, R.E. Smalley, Nature, 1985, 318, 162.
H.W. Kroto, J.E. Fichier, D.E. Cox, “The Fullerene”, Pergamon Press, New York, 1993.
A.R. Ashrafi, G.H. Fath-Tabar, Appl. Math. Lett., 2011, 24, 337.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Studia Universitatis Babeș-Bolyai Chemia
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
