Related papers: Complemented zero-divisor graph of posets

Let $G$ be a $2$-generated group. The generating graph $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g_1$ and $g_2$ are adjacent if $G = \langle g_1, g_2 \rangle.$ This graph encodes the…

A graph $G$ has a perfect division if its vertex set can be partitioned into two sets $A$, $B$ such that $G[A]$ is perfect and $\omega(G[B]) < \omega(G)$. We call $G$ perfectly divisible if every induced subgraph of $G$ admits a perfect…

Let $R$ be a commutative ring with identity and let $Z^{\ast}(R)$ denote the set of nonzero zero-divisors of $R$. The \emph{zero-divisor graph} $ \varGamma(R)$ is the simple graph with vertex set $V( \varGamma(R))=Z^{\ast}(R)$, where two…

Let $R$ be a commutative ring and let $I$ be an ideal of $R$. In this paper, we introduce the cozero-divisor graph $\acute{\Gamma}_I(R)$ of $R$ and obtain some related results.

For a commutative ring $R$, the zero-divisor graph of $R$ is a simple graph with the vertex set as the set of all zero-divisors of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $xy = 0$. This article attempts to…

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…

Interaction between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called…

A graph $\Gamma$ is $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$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Let $R$ be a commutative ring and $I$ be an ideal of $R$. The amalgamated duplication of $R$ along $I$ is the subring $R\Join I:=\{(r,r+i)| r\in R, i\in I\}$ of $R\times R$. This paper investigates the extended zero-divisor graph of the…

We prove that the chromatic polynomial $P_\mathbb{G}(q)$ of a finite graph $\mathbb{G}$ of maximal degree $\D$ is free of zeros for $\card q\ge C^*(\D)$ with $$ C^*(\D) = \min_{0<x<2^{1\over \D}-1} {(1+x)^{\D-1}\over x [2-(1+x)^\D]} $$ This…

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…

In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…

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. We consider the zero divisor graph…

Let overline{\Gamma(R)} be the complement of zero divisor graph of a finite commutative ring R. In this article, we have provided the answer of the question (ii) raised by Osba and Alkam in their paper and prove that overline{\Gamma(R)} is…

The zero divisor graph of a commutative ring $R$ with unity is a graph whose vertices are the nonzero zero-divisors of the ring, with two distinct vertices being adjacent if their product is zero. This graph is denoted by $\Gamma(R)$. In…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

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$ and $S$ be commutative rings with identity, $f:R\to S$ a ring homomorphism and $J$ an ideal of $S$. Then the subring $R\bowtie^fJ:=\{(r,f(r)+j)\mid r\in R$ and $j\in J\}$ of $R\times S$ is called the amalgamation of $R$ with $S$…

Let $\gamma(G)$ and $\beta(G)$ denote the domination number and the covering number of a graph $G$, respectively. A connected non-trivial graph $G$ is said to be $\gamma\beta$-{perfect} if $\gamma(H)=\beta(H)$ for every non-trivial induced…

A graph $G$ is perfectly divisible if, for every induced subgraph $H$ of $G$, either $V(H)$ is a stable set or admits a partition into two sets $X_1$ and $X_2$ such that $\omega(H[X_1]) < \omega(H)$ and $H[X_2]$ is a perfect graph. In this…