Further results on enumeration of perfect matchings of Cartesian product graphs
Sign Up to like & getrecommendations! Published in 2024 at "Open Mathematics"
DOI: 10.1515/math-2024-0060
Abstract: Abstract Counting perfect matchings is an interesting and challenging combinatorial task. It has important applications in statistical physics and chemistry. As the general problem is #P-complete, it is usually tackled by randomized heuristics and approximation… read more here.
Keywords: results enumeration; product graphs; cartesian product; perfect matchings ... See more keywords