University of Kashan Iranian Journal of Mathematical Chemistry 2228-6489 9 4 2018 12 01 On the Saturation Number of Graphs 289 299 81558 10.22052/ijmc.2018.113339.1337 EN S. Alikhani Yazd University, iran N. Soltani Yazd University, Iran Journal Article 2018 01 05 Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such 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)$. <br /> 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. https://ijmc.kashanu.ac.ir/article_81558_806cdc8af74e642c5afec1d82f3f77db.pdf