Centroid and algebraic properties of evolution algebras through graphs

The leitmotiv of this paper is linking algebraic properties of an evolution algebra with combinatorial properties of the (possibly several) graphs that one can associate to the algebra. We link nondegeneracy, zero annihilator, absorption property, von Neumann regularity, and primeness with suitable properties in the associated graph. In the presence of semiprimeness, the property of primeness is equivalent to any associated graph being downward directed. We also provide a description of the prime ideals in an evolution algebra and prove that certain algebraic properties, such as semiprimeness and perfection, can not be characterized in combinatorial terms. We describe the centroid of evolution algebras as constant functions along the connected components of its associated graph. The dimension of the centroid of a zero annihilator algebra $A$ agrees with the cardinal of the connected components of any possible graph associated to $A$. This is the combinatorial expression of an algebraic uniqueness property in the decomposition of $A$ as indecomposable algebras with $1$-dimensional centroid.