富勒烯图的夹心饱和数
Sandwiching saturation number of fullerene graphs
摘要：
图$G$的饱和数是图$G$的任意最小最大匹配的基数，记为$s(G)$。富勒烯图是三次可平面图，它正好有12个5-面，其他面都是六边形。它们被用来捕捉碳分子的结构。在这里，我们表明，$n$顶点上的富勒烯的饱和数本质上是$n/3$。
英文摘要：
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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
