Related papers: On reduced zero-divisor graphs of posets
In this paper, we characterize chordal and perfect zero-divisor graphs of finite posets. Also, it is proved that the zero-divisor graphs of finite posets and the complement of zero-divisor graphs of finite $0$-distributive posets satisfy…
We study the zero divisor graph determined by equivalence classes of zero divisors of a commutative Noetherian ring R. We demonstrate how to recover information about R from this structure. In particular, we determine how to identify…
In this paper, we derive a set of equivalent conditions for the zero-divisor graph $\Gamma(Q)$ of a poset $Q$ with $0$ to be complemented, characterizing it in terms of quasi-complemented posets. Furthermore, we prove that the notions of a…
In this paper, we study the zero-divisor graphs of a subclass of dismantlable lattices. These graphs are characterized in terms of the non-ancestor graphs of rooted trees.
We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…
In this paper, we study the genera of zero-divisor graphs with respect to ideals in finite rings.
Let $R$ be a commutative ring with identity and let $I$ be an ideal of $R$. Let $R\Join I$ be the subring of $R\times R$ consisting of the elements $(r,r+i)$ for $r\in R$ and $i\in I$. We study the diameter and girth of the zero-divisor…
The proper divisor graph $\Upsilon_n$ of a positive integer $n$ is the simple graph whose vertices are the proper divisors of $n$, and in which two distinct vertices $u, v$ are adjacent if and only if $n$ divides $uv$. The graph…
We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an \emph{Armendariz map} between such semigroups, which preserves many graph-theoretic…
In this paper, nonzero component graphs and nonzero component union graphs of finite dimensional vector space are studied using the zero-divisor graph of specially constructed 0-1-distributive lattice and the zero-divisor graph of rings.…
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.
If $E$ is a graph and $K$ is a field, we consider an ideal $I$ of the Leavitt path algebra $L_K(E)$ of $E$ over $K$. We describe the admissible pair corresponding to the smallest graded ideal which contains $I$ where the grading in question…
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…
In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gr\"obner basis of the toric ideal of the poset. Strong…
Let $R$ be a commutative ring with identity and $\Bbb A (R)$ be the set of ideals of $R$ with non-zero annihilator. The annihilator-ideal graph of $R$, denoted by $A_{I} (R) $, is a simple graph with the vertex set $\Bbb A(R)^{\ast} := \Bbb…
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)$…
Let $R$ be a commutative ring with nonzero identity and $I$ a proper ideal of $R$. The {\it ideal-based zero-divisor graph} of $R$ with respect to the ideal $I$, denoted by $\Gamma_I(R)$, is the graph on vertices $\{x \in R\setminus I \mid…
This paper is an endeavor to discuss some properties of zero-divisor graphs of the ring $\mathbb{Z}_n$, the ring of integers modulo $n$. The zero divisor graph of a commutative ring $R$, is an undirected graph whose vertices are the nonzero…
We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.
The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs…