English
Related papers

Related papers: Ideal-based quasi cozero divisor graph of a commut…

200 papers

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

Commutative Algebra · Mathematics 2020-08-13 Takayuki Hibi , Hiroju Kanno , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

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)…

Group Theory · Mathematics 2025-08-06 Yanhui Wang , Xinyi Zhu , Pei Gao

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

Rings and Algebras · Mathematics 2020-08-11 T. Alraqad , H. Saber , R. Abu-Dawwas

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…

Commutative Algebra · Mathematics 2015-09-03 Neil Epstein , Peyman Nasehpour

Suppose that $R$ is a finite commutative ring with identity. The involutory Cayley graph $\G(R)$ of $R$ is the graph whose vertices are the elements of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $(x-y)^2=1$. In…

Combinatorics · Mathematics 2025-08-05 Hamide Keshavarzi , Babak Amini , Afshin Amini , Shahin Rahimi

A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be a ring and $I(R)^*$ be the set of all left proper non-trivial ideals of $R$. The intersection graph of ideals of $R$, denoted by $G(R)$, is…

Commutative Algebra · Mathematics 2013-05-28 R. Nikandish , M. J. Nikmehr

We have tried to translate some graph properties of AG(R) and Gamma(R) to the topological properties of Zariski topology. We prove that Rad(Gamma(R)) and Rad(AG(R)) are equal and they are equal to 3, if and only if the zero ideal of R is an…

Commutative Algebra · Mathematics 2019-05-14 Mehdi Badie

In this paper we study zero--divisor graphs of rings and semirings. We show that all zero--divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic…

Rings and Algebras · Mathematics 2011-05-23 David Dolžan , Polona Oblak

In this paper we study sub-semigroups of a zero-divisor semigroup $S$ determined by properties of the zero-divisor graph $\Gamma(S)$. We use these sub-semigroups to study the correspondence between zero- divisor semigroups and zero-divisor…

Rings and Algebras · Mathematics 2018-04-24 Tongsuo Wu , Dancheng Lu

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…

Combinatorics · Mathematics 2022-05-11 Nilesh Khandekar , Vinayak Joshi

In this article, we introduce a generalization of the concept of graded $r$-ideals in graded commutative rings with nonzero unity. Let $G$ be a group, $R$ be a $G$-graded commutative ring with nonzero unity and $GI(R)$ be the set of all…

Commutative Algebra · Mathematics 2021-04-13 Rashid Abu-Dawwas , Malik Bataineh , Ghida'a Al-Qura'an

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…

Commutative Algebra · Mathematics 2018-07-02 A. Cherrabi , H. Essannouni , E. Jabbouri , A. Ouadfel

Let $R$ be a commutative ring with unity. The essential ideal graph $\mathcal{E}_{R}$ of $R$ is a graph whose vertex set consists of all nonzero proper ideals of \textit{R}. Two vertices $\hat{I}$ and $\hat{J}$ are adjacent if and only if…

Combinatorics · Mathematics 2024-07-04 Jamsheena P , Chithra A

A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…

Combinatorics · Mathematics 2016-11-22 Ricky Rotheram , Sanming Zhou

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…

Commutative Algebra · Mathematics 2024-11-13 Le Xuan Dung , Thanh Vu

Inspired by a very recent work of A. {\DH}uri\'c, S. Jev{\dj}eni\'c and N. Stopar, we introduce a new definition of zero-divisor graphs attached to rings, that includes all of the classical definitions already known in the literature. We…

Commutative Algebra · Mathematics 2022-03-08 Enrico Sbarra , Maurizio Zanardo

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…

Commutative Algebra · Mathematics 2009-08-17 Sandra Spiroff , Cameron Wickham

For any Tychonoff space X we have introduced the zero-set in-tersection graph on {\Gamma}(C+(X)) and studied the graph properties in connection with the algebraic properties of the semiring C+(X). We have shown that for any two realcompact…

General Topology · Mathematics 2024-07-12 Soumi Basu , Bedanta Bose

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…

Group Theory · Mathematics 2019-10-30 Hoang Thanh Nguyen , Hung Cong Tran

The divisor graph is the non oriented graph whose vertices are the positive integers, and edges are the {a,b} such that a divides b or b divides a. Let F(x,y) be the maximum number of integers<= x belonging in one of y pairwise disjoint…

Combinatorics · Mathematics 2025-02-18 Eric Saias