| Abstract |
In this paper, new advances concerning the link between evolution algebras and (pseudo)digraph are shown. Some important elements that can be read from the (pseudo)digraph that is associated with an evolution algebra are studied. Moreover, several results concerning solvability, nilpotency, and the preservation of them under the graph union operation are proved. To complement the theoretical study, an algorithmic method has been implemented. This is devoted to computing the nilpotency index of a nilpotent evolution algebra using its associated digraph. © 2022, The Author(s) under exclusive licence to Sociedade Brasileira de Matemática Aplicada e Computacional. |
Gestionar cookies