2 papers
math.CO2021
Matching forcing polynomial of generalized Petersen graph GP(n, 2)
Shuang Zhao
Harary et al. and Klein and Randic proposed the forcing number of a perfect matching in mathematics and chemistry, respectively. In detail, the forcing number of a perfect matching…
math.CO2017
On the forcing spectrum of generalized Petersen graphs P(n,2)
Shuang Zhao, Jinjiang Zhu, Heping Zhang
The forcing number of a perfect matching of a graph is the smallest cardinality of subsets of that are contained in no other perfect matchings of . The forcing spect…