Some results on fullerene graphs

Fullerene graphs are 3-connected planar cubic graphs with all faces of size 5 or 6. Motivation to study this class of graphs came from chemistry. In my talk I will present some bounds on the invariants as diameter, the independence number, the smallest eigenvalue, bipartite edge frustration, and saturation number.