科研之友
微信
新浪微博
Facebook
分享链接
摘要
The forcing number of a perfect matching M of a graph G is the minimal number of edges of M that are contained in no other perfect matchings of G. The anti-forcing number of M in G is the minimal number of edges of G not in M whose deletion results in a subgraph with a unique perfect matching M. Recently the forcing and anti-forcing polynomials of perfect matchings of a graph were proposed as counting polynomials for perfect matchings with the same forcing number and anti-forcing number respectively. In this paper, we focus on 2xn and 3x2n grids, and obtain the explicit expressions of their forcing and anti-forcing polynomials. As corollaries, their forcing and anti-forcing spectra are obtained.
- 出版日期2019-1
- 单位兰州大学
