on the saturation number of graphs

Let g = (v, e) be a simple connected graph. a matching g in a graph g is a collection of edges of gsuch that no two edges from m share a vertex. a matching m is maximal if it cannot be extended to a larger matching in g . the cardinality of any smallest maximal matching in g is the saturation number of g and is denoted by s(g). in this paper we study the saturation number of the corona product of two specific graphs. we also consider some graphs with certain constructions that are of importance in chemistry and study their saturation number.