Spectral Properties of Fullerene Graphs

Fullerenes are polyhedral molecules made of carbon atoms. They have attracted much attention in the chemical and the mathematical literature.In the present paper, we investigate problems concerned with the eigenvalues of fullerene graphs. We obtain new upper bounds for the smallest eigenvalues of fullerenes using bipartite edge-frustration of their related subgraphs.