On some structural properties of generalized fullerene graphs with 13 pentagonal faces

It is shown that every generalized fullerene graph GG with 13 pentagons is 2-extendable, a brick, and cyclically 5-edge-connected, i.e., that GG cannot be separated into two components, each containing a cycle, by deletion of fewer than five edges. New lower bound on the number of perfect matchings in such graphs are also established.