Related papers: When Ideal-based Zero-divisor Graphs are Complemen…

Let $R$ be a commutative $G$-graded ring with a nonzero unity. In this article, we introduce the concept of graded radically principal ideals. A graded ideal $I$ of $R$ is said to be graded radically principal if $Grad(I)=Grad(\langle…

Let $M$ be a left module over a ring $R$ and $I$ an ideal of $R$. $M$ is called an $I$-supplemented module (finitely $I$-supplemented module) if for every submodule (finitely generated submodule) $X$ of $M$, there is a submodule $Y$ of $M$…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

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…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…

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…

Let $R$ be a commutative ring with identity. An ideal $I$ of $R$ is said to be a big ideal (resp. an upper big ideal) if whenever $J\subsetneqq I$ (resp. $I\subsetneqq J$), $J^{n}\subsetneqq I^{n}$ (resp. $I^{n}\subsetneqq J^{n}$) for every…

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…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Let $G$ be a finite simple graph on $[n]$ and $I(G) \subset S$ the edge ideal of $G$, where $S = K[x_{1}, \ldots, x_{n}]$ is the polynomial ring over a field $K$. Let $m(G)$ denote the maximum size of matchings of $G$ and $im(G)$ that of…

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…

In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…

As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…

The undirected zero divisor graph of a commutative ring with unity \( R \), denoted by \( \Gamma(R) = (V(\Gamma(R)), E(\Gamma(R))) \). The vertex set \( V(\Gamma(R)) \) consists of all the non-zero zero-divisors of \( R \). The edge set \(…

In this paper, we point out several errors in [M.Afkhami, K.Khashyarmanesh and K.Nafar, Zero divisor graph of a lattice with respect to an ideal, Beitr Algebra Geom (2015), 217-225.]. In the previous article, Afkhami claimed that the…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{eqnarray*} V(\Gamma) &=& \{(x,y) \ | \ x \in V(X) \ \& \ y…

In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [20]. The present paper mainly deals with an Isomorphism Problem for the zero-divisor graphs of lattices. In fact, we prove…