14 citations · 26 across the 14 of their papers we have counts for
1 paper · 1 filter
Vesna Andova, František Kardoš, Riste Škrekovski
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…