
doi: 10.12958/adm1663
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.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Combinatorial aspects of tessellation and tiling problems, Brauer configuration algebra, Cluster algebras, perfect matching, Exact enumeration problems, generating functions, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci number, snake graph, Enumeration in graph theory
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Combinatorial aspects of tessellation and tiling problems, Brauer configuration algebra, Cluster algebras, perfect matching, Exact enumeration problems, generating functions, Fibonacci and Lucas numbers and polynomials and generalizations, Fibonacci number, snake graph, Enumeration in graph theory
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
