2000 character limit reached
Eulerian of the Zero Divisor graph $Γ[\mathbb {Z}_n]$
Published 5 Jan 2020 in math.RA | (2001.01219v1)
Abstract: 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 $\Gamma[\mathbb{Z}_n]$, for any natural number $n$ and find out which graphs are Eulerian graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.