Abstract
In this paper, suitable Brauer configuration algebras are used to give an explicit formula for the number of perfect matchings of a snake graph. Some relationships between Brauer configuration algebras with path problems as the Lindstr\"om problem are described as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have