On non-commuting graph of a finite ring
Abstract
The non-commuting graph R of a finite ring R with center Z(R) is a simple undirected graph whose vertex set is R Z(R) and two distinct vertices a and b are adjacent if and only if ab ba. In this paper, we show that R is not isomorphic to certain graphs of any finite non-commutative ring R. Some connections between R and commuting probability of R are also obtained. Further, it is shown that the non-commuting graphs of two Z-isoclinic rings are isomorphic if the centers of the rings have same order
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.