4 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.CO2021
Matching anti-forcing polynomials of catacondensed hexagonal systems
Shuang Zhao
In this paper, we derive a recurrence relation of anti-forcing polynomial for catacondensed hexagonal systems.
math.CO2021
Matching forcing polynomials of constructable hexagonal systems
Shuang Zhao
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
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…