On some relationships between snake graphs and Brauer configuration algebras

P. F. F. Espinosa, J. F. González, J. P. Herrán, A. M. Cañadas, J. L. Ramírez


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.


Brauer configuration algebra, Fibonacci number, perfect matching, snake graph

Full Text:


DOI: http://dx.doi.org/10.12958/adm1663


  • There are currently no refbacks.