TY - JOUR
ID - 81558
TI - On the Saturation Number of Graphs
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Alikhani, S.
AU - Soltani, N.
AD - Yazd University, iran
AD - Yazd University, Iran
Y1 - 2018
PY - 2018
VL - 9
IS - 4
SP - 289
EP - 299
KW - Maximal matching
KW - Saturation number
KW - corona
DO - 10.22052/ijmc.2018.113339.1337
N2 - 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)$. 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.
UR - https://ijmc.kashanu.ac.ir/article_81558.html
L1 - https://ijmc.kashanu.ac.ir/article_81558_806cdc8af74e642c5afec1d82f3f77db.pdf
ER -