Related papers: On Irreducible Divisor Graphs in Commutative Rings…
We provide a construction of the induced subgraphs of the zero-divisor graph of $M_2(R)$ for the ring $R$ of algebraic integers of some number fields that are neither complete nor connected, and study the structure of the induced subgraphs…
This paper investigates the homology groups of the clique complex associated with the zero-divisor graph of a finite commutative ring. Generalizing the construction introduced by F. R. DeMeyer and L. DeMeyer, we establish a Kunneth-type…
Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…
In algebra, atomicity is the study of divisibility by and factorizations into atoms (also called irreducibles). In one side of the spectrum of atomicity we find the antimatter algebraic structures, inside which there are no atoms and,…
Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…
The non-solvable graph of a finite group G is a simple graph whose vertices are the elements of G and there is an edge between x and y if and only if the subgroup generated by x and y is not solvable. The isolated vertices in the…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Let $R$ be a commutative ring with unity. The weakly zero-divisor graph $W\Gamma(R)$ of the ring $R$ is the simple undirected graph whose vertices are nonzero zero-divisors of $R$ and two vertices $x$, $y$ are adjacent if and only if there…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
We introduce noncommutative rings with $DK$-property (Dubrovin-Komarnytsky's property) and investigate elementary divisor rings with such property. Mostly we pay attention to these kinds of noncommutative rings which have stable range $1$.…
In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
Let $R$ be a commutative ring with $1\neq 0$ and $\Bbb{A}(R)$ be the set of ideals with nonzero annihilators. The annihilating-ideal graph of $R$ is defined as the graph $\Bbb{AG}(R)$ with the vertex set $\Bbb{A}(R)^{*} =…
In the last two decades new techniques emerged to construct valuations on an infinite division ring $D,$ given a normal subgroup $N\subseteq D$ of finite index. These techniques were based on the commuting graph of $D^{\times}/N$ in the…
We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
Let $G$ be a graph, $\chi(G)$ be the minimal number of colors which can be assigned to the vertices of $G$ in such a way that every two adjacent vertices have different colors and $\omega(G)$ to be the least upper bound of the size of the…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…