On some singular graphs with non-isomorphic associated evolution algebras

Abstract

A connected graph can be associated with two distinct evolution algebras. In the first case, the structural matrix is the adjacency matrix of the graph itself. In the second case, the structural matrix is the transition probabilities matrix of the symmetric random walk on the same graph. It is well-known that, for a non-singular graph, both evolution algebras are isomorphic if, and only if, the graph is regular or biregular. Moreover, through examples and partial results, it has been conjectured that the same result remains true for singular graphs. The purpose of this work is to provide new examples supporting this conjecture.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…