let $r$ be a commutative ring with identity. let $g(r)$ denote the maximal graph associated to $r$, i.e., $g(r)$ is a graph with vertices as the elements of $r$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $r$ containing both. let $gamma(r)$ denote the restriction of $g(r)$ to non-unit elements of $r$. in this paper we study the various graphi...

Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

Recently, Katre et al. introduced the concept of coprime index a graph. They asked to characterize graphs for which is same as clique number. In this paper, we partially solve problem. fact, prove that number and zero-divisor graph an ordered set ring Zpn coincide. Also, it proved annihilating ideal graphs, co-annihilating comaximal commutative rings can be realized specially constructed posets...

Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undi...

let $g=(v,e)$ be a simple graph. a set $ssubseteq v$ isindependent set of $g$,  if no two vertices of $s$ are adjacent.the  independence number $alpha(g)$ is the size of a maximumindependent set in the graph. in this paper we study and characterize the independent sets ofthe zero-divisor graph $gamma(r)$ and ideal-based zero-divisor graph $gamma_i(r)$of a commutative ring $r$.

Let R be a commutative ring with identity and A(R) be the set of ideals with nonzero annihilator. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A(R) = A(R)r {0} and two distinct vertices I and J are adjacent if and only if IJ = 0. In this paper, we study the domination number of AG(R) and some connections between the domination numbers of annihilating-ideal...