关键词: {(3,4),4}-Fullerene graph, k-Resonant, Maximally resonant

Abstract: A {(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces
are of length 3 or 4. It follows from Euler’s formula that the number of triangular faces
is eight. A set H of disjoint quadrangular faces of S is called resonant pattern if S
has a perfect matching M such that every quadrangular face in H is M-alternating.
Let k be a positive integer, S is k-resonant if any i≤k disjoint quadrangular faces of
S form a resonant pattern. Moreover, if graph S is k-resonant for any integer k, then
S is called maximally resonant.

Key words: {(3,4),4}-Fullerene graph, k-Resonant, Maximally resonant