Sandwiching saturation number of fullerene graphs

Abstract

The saturation number of a graph $G$ is the cardinality of any smallest maximal matching of $G$, and it is denoted by $s(G)$. Fullerene graphs are cubic planar graphs with exactly twelve 5-faces; all the other faces are hexagons. They are used to capture the structure of carbon molecules. Here we show that the saturation number of fullerenes on $n$ vertices is essentially $n/3$.

Cited by in corpus (2)

• On the saturation number of graphs
• More on the sixth coefficient of the matching polynomial in regular graphs