On some relationships between snake graphs and Brauer configuration algebras
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.
Збережено в:
| Дата: | 2022 |
|---|---|
| Автори: | , , , , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2022
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1663 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |