Sandwiching saturation number of fullerene graphs
Combinatorics
2014-05-12 v1
Abstract
The saturation number of a graph is the cardinality of any smallest maximal matching of , and it is denoted by . 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 vertices is essentially .
Cite
@article{arxiv.1405.2197,
title = {Sandwiching saturation number of fullerene graphs},
author = {Vesna Andova and František Kardoš and Riste Škrekovski},
journal= {arXiv preprint arXiv:1405.2197},
year = {2014}
}