2000 character limit reached
On non-commuting graph of a finite ring
Published 15 Mar 2017 in math.RA | (1703.05039v1)
Abstract: The non-commuting graph $\Gamma_R$ of a finite ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R \setminus Z(R)$ and two distinct vertices $a$ and $b$ are adjacent if and only if $ab \ne ba$. In this paper, we show that $\Gamma_R$ is not isomorphic to certain graphs of any finite non-commutative ring $R$. Some connections between $\Gamma_R$ and commuting probability of $R$ are also obtained. Further, it is shown that the non-commuting graphs of two $\mathbb{Z}$-isoclinic rings are isomorphic if the centers of the rings have same order
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.