相关论文: On Irreducible Divisor Graphs in Commutative Rings…
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
Let $S$ be an inverse semigroup with zero and let $Z(S)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b)…
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…
In this paper, we show that it is possible for a commutative ring with identity to be non-atomic (that is, there exist non-zero nonunits that cannot be factored into irreducibles) and yet have a strongly atomic polynomial extension. In…
The global defensive $k$-alliance is a very well studied notion in graph theory, it provides a method of classification of graphs based on relations between members of a particular set of vertices. In this paper we explore this notion in…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The compressed zero divisor graph $\Gamma_E[R]$ is…
We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…
We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…
Let $R$ be a commutative ring with unity and $R^{+}$ be $Z^*(R)$ be the additive group and the set of all non-zero zero-divisors of $R$, respectively. We denote by $\mathbb{CAY}(R)$ the Cayley graph $Cay(R^+,Z^*(R))$. In this paper, we…
We continue our study of the new extension of zero-divisor graph. We give a complete characterization for the possible diameters of $\widetilde{\Gamma}(R)$ and $\widetilde{\Gamma}(R[x_1,\dots,x_n])$, we investigate the relation between the…
For an artinian ring $R$, the directed zero-divisor graph $\Gamma(R)$ is connected if and only if there is no proper one-sided identity element in $R$. Sinks and sources are characterized and clarified for finite ring $R$, especially, it is…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…
This article provides the basic algebraic background on infinitesimal deformations and presents the proof of the well-known fact that the non-trivial infinitesimal deformations of a $K$-algebra $R$ are parameterized by the elements of…
For a ring $R$, the zero-divisor graph is a simple graph $\Gamma(R)$ whose vertex set is the set of all non-zero zero-divisors in a ring $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy=0$ or $yx=0$ in $R$. By…
A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
In this paper, we determine bipartite graphs and complete graphs with horns, which are realizable as zero-divisor graphs of po-semirings. As applications, we classify commutative rings $R$ whose annihilating-ideal graph $\mathbb {AG}(R)$…