Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings

DOI10.46793/match.87-3.561LzbMath1492.92157OpenAlexW3215869494MaRDI QIDQ5091506

Congcong Ma, Haiyuan Yao, Yutong Liu, Xu Wang

Publication date: 26 July 2022

Published in: MATCH Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.87-3.561l

Mathematics Subject Classification ID

Integer programming (90C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)

Related Items

Forcing and anti-forcing polynomials of a type of polyomino graphs