Zero-Divisors and Their Graph Languages

We introduce the use of formal languages in place of zero-divisor graphs used to study theoretic properties of commutative rings. We show that a regular language called a graph language can be constructed from the set of zero-divisors of a commutative ring. We then prove that graph languages are equivalent to their associated graphs. We go on to define several properties of graph languages

On annihilator graph of a finite commutative ring

‎The annihilator graph $AG(R)$ of a commutative ring $R$ is a simple undirected graph with the vertex set $Z(R)^*$ and two distinct vertices are adjacent if and only if $ann(x) cup ann(y)$ $neq$ $ann(xy)$‎. ‎In this paper we give the sufficient condition for a graph $AG(R)$ to be complete‎. ‎We characterize rings for which $AG(R)$ is a regular graph‎, ‎we show that $gamma (AG(R))in {1,2}$ and we also characterize the rings for which $AG(R)$ has a cut vertex‎. ‎Finally we find the clique number of a finite reduced ring and characterize the rings for which $AG(R)$ is a planar graph‎