On the forcing spectrum of generalized Petersen graphs P(n,2)

Shuang Zhao, Jinjiang Zhu, Heping Zhang

The forcing number of a perfect matching $M$ of a graph $G$ is the smallest cardinality of subsets of $M$ that are contained in no other perfect matchings of $G$. The forcing spect…