相关论文: On the isomorphisms between evolution algebras of …

Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…

For a quantum walk on a graph, there exist many kinds of operators for the discrete-time evolution. We give a general relation between the characteristic polynomial of the evolution matrix of a quantum walk on edges and that of a kind of…

We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…

This work classifies three-dimensional simple evolution algebras over arbitrary fields. For this purpose, we use tools such as the associated directed graph, the moduli set, inductive limit group, Zariski topology and the dimension of the…

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…

Random walk spaces are a general framework for the study of PDEs. They include as particular cases locally finite weighted connected graphs and nonlocal settings involving symmetric integrable kernels on $\mathbb{R}^N$. We are interested in…

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…

Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…

Inspired by theories such as Loop Quantum Gravity, a class of stochastic graph dynamics was studied in an attempt to gain a better understanding of discrete relational systems under the influence of local dynamics. Unlabeled graphs in a…

In this paper, we introduce Volterra evolution algebras which are evolution algebras whose structural matrices are described by skew symmetric matrices. A main result of the present paper gives a connection between such kind of algebras…

We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…

We consider the intersection $\mathfrak{M}(A)$ of all maximal ideals of an evolution algebra $A$ and study the structure of the quotient $A/\M(A)$. In a previous work, maximal ideals have been related to hereditary subsets of a graph…

An evolution algebra corresponds to a quadratic matrix $A$ of structural constants. It is known the equivalence between nil, right nilpotent evolution algebras and evolution algebras which are defined by upper triangular matrices $A$. We…

When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…

Let $\ell \geqslant 0$ be an integer, and $G$ be a graph without loops. An $\ell$-link of $G$ is a walk of length $\ell$ in which consecutive edges are different. We identify an $\ell$-link with its reverse sequence. The $\ell$-link graph…

Evolution in finite populations is often modelled using the classical Moran process. Over the last ten years this methodology has been extended to structured populations using evolutionary graph theory. An important question in any such…

We present the implementation of an algorithm for graph isomorphism testing, based on ideas about number of walks (of sufficiently large length) between vertices. The algorithm is expanded for strongly regular graphs (SRG-s) by testing the…