Related papers: On the isomorphisms between evolution algebras of …
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Automorphisms of order $2$ are studied in order to understand generalized symmetric spaces. The groups of type $E_6$ we consider here can be realized as both the group of linear maps that leave a certain determinant invariant, and also as…
We geometrically describe the relation induced on a set of graphs by isomorphism of their associated graph C*-algebras as the smallest equivalence relation generated by five types of moves. The graphs studied have finitely many vertices and…
Let $G$ be a group. The directed endomorphism graph, \dend of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex `$a$' to the vertex `$\, b$' $(a \neq b) $ if and only if there exists an endomorphism on…
We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We will study evolution algebras $A$ which are free modules of dimension $2$ over domains. Furthermore, we will assume that these algebras are perfect, that is $A^2=A$. We start by making some general considerations about algebras over…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
The aim of this work is the description of the isomorphism classes of all Leavitt path algebras coming from graphs satisfying Condition (Sing) with up to three vertices. In particular, this classification recovers the one achieved by Abrams…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
We investigate a randomly evolving process of subgraphs in an underlying host graph using the spectral theory of semigroups related to the Tsetlin library and hyperplane arrangements. Starting with some initial subgraph, at each iteration,…
We study diffusion-type equations supported on structures that are randomly varying in time. After settling the issue of well-posedness, we focus on the asymptotic behavior of solutions: our main result gives sufficient conditions for…
In this paper we show that evolution algebras over any given field $\Bbbk$ are universally finite. In other words, given any finite group $G$, there exist infinitely many regular evolution algebras $X$ such that $Aut(X)\cong G$. The proof…
In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
The first part of the book is devoted to the symmetry approach to classification of scalar integrable evolution PDEs with two independent variables. In the second part systems of evolution equations with polynomial homogeneous right-hand…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…