Global forcing number for maximal matchings in corona products

Sandi Klavžar, Mostafa Tavakoli, Gholamreza Abrishami

A global forcing set for maximal matchings of a graph $G=(V(G),E(G))$ is a set $S\subseteq E(G)$ such that $M_1\cap S\ne M_2\cap S$ for each pair of maximal matchings $M_1$ an…