11 citations · 12 across the 2 of their papers we have counts for
2 papers
math.CO2020★ 1 cited
Forcing and anti-forcing polynomials of a polyomino graph
Kai Deng, Huazhong Lü, Tingzeng Wu
The forcing number of a perfect matching in a graph is the smallest number of edges inside that can not be contained in other perfect matchings. The anti-forcing number…
math.CO2020★ 11 cited
Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
Kai Deng, Saihua Liu, Xiangqian Zhou
The forcing number of a perfect matching of a graph was introduced by Harary et al., which originated from Klein and Randić's ideal of innate degree of freedom of Kekulé structure…