[HTML][HTML] Anti-forcing numbers of perfect matchings of graphs
H Lei, YN Yeh, H Zhang - Discrete Applied Mathematics, 2016 - Elsevier
We define the anti-forcing number of a perfect matching M of a graph G as the minimal
number of edges of G whose deletion results in a subgraph with a unique perfect matching …
number of edges of G whose deletion results in a subgraph with a unique perfect matching …
[PDF][PDF] Forcing on perfect matchings-A survey
Z Che, Z Chen - MATCH Commun. Math. Comput. Chem, 2011 - match.pmf.kg.ac.rs
The notions of a forcing edge and the forcing number of a perfect matching first appeared in
a 1991 paper [15] by Harary, Klein and Zivkovic. The root of these concepts can be traced to …
a 1991 paper [15] by Harary, Klein and Zivkovic. The root of these concepts can be traced to …
[HTML][HTML] Forcing matching numbers of fullerene graphs
H Zhang, D Ye, WC Shiu - Discrete Applied Mathematics, 2010 - Elsevier
The forcing number or the degree of freedom of a perfect matching M of a graph G is the
cardinality of the smallest subset of M that is contained in no other perfect matchings of G. In …
cardinality of the smallest subset of M that is contained in no other perfect matchings of G. In …
Continuous forcing spectra of even polygonal chains
H Zhang, X Jiang - Acta Mathematicae Applicatae Sinica, English Series, 2021 - Springer
Let G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M is
a subset of M such that it is contained in no other perfect matchings of G. The cardinality of a …
a subset of M such that it is contained in no other perfect matchings of G. The cardinality of a …
[PDF][PDF] The forcing polynomial of catacondensed hexagonal systems
H Zhang, S Zhao, R Lin - MATCH Commun. Math. Comput …, 2015 - match.pmf.kg.ac.rs
Klein and Randic defined the innate degree of freedom of a graph G as the sum of the
forcing numbers (innate degree of freedom) of perfect matchings of graph G. In this paper …
forcing numbers (innate degree of freedom) of perfect matchings of graph G. In this paper …
Anti-forcing spectra of perfect matchings of graphs
K Deng, H Zhang - Journal of Combinatorial Optimization, 2017 - Springer
Let M be a perfect matching of a graph G. The smallest number of edges whose removal to
make M as the unique perfect matching in the resulting subgraph is called the anti-forcing …
make M as the unique perfect matching in the resulting subgraph is called the anti-forcing …
[PDF][PDF] Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings
Y Liu, C Ma, H Yao, X Wang - MATCH Commun. Math. Comput …, 2022 - match.pmf.kg.ac.rs
The forcing polynomial and anti-forcing polynomial are two important enumerative
polynomials associated with all perfect matchings of a graph. In a graph with large order, the …
polynomials associated with all perfect matchings of a graph. In a graph with large order, the …
Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids
S Zhao, H Zhang - Journal of Mathematical Chemistry, 2019 - Springer
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 …
M that are contained in no other perfect matchings of G. The anti-forcing number of M in G is …
Forcing and anti-forcing polynomials of perfect matchings of a pyrene system
K Deng, S Liu, X Zhou - arXiv preprint arXiv:2004.05112, 2020 - arxiv.org
The forcing number of a perfect matching of a graph was introduced by Harary et al., which
originated from Klein and Randi\'{c}'s ideal of innate degree of freedom of Kekul\'{e} structure …
originated from Klein and Randi\'{c}'s ideal of innate degree of freedom of Kekul\'{e} structure …
[HTML][HTML] On forcing matching number of boron–nitrogen fullerene graphs
X Jiang, H Zhang - Discrete applied mathematics, 2011 - Elsevier
Let G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M is
a subset of M such that it is contained in no other perfect matchings of G. The smallest …
a subset of M such that it is contained in no other perfect matchings of G. The smallest …