On generalized non-commuting graph of a finite ring
Abstract
Let S, K be two subrings of a finite ring R. Then the generalized non-commuting graph of subrings S, K of R, denoted by S, K, is a simple graph whose vertex set is (S K) (CK(S) CS(K)) and two distinct vertices a, b are adjacent if and only if a ∈ S or b ∈ S and ab ≠ ba. We determine the diameter, girth and some dominating sets for S, K. Some connections between the S, K and (S, K) are also obtained. Further, -isoclinism between two pairs of finite rings is defined and showed that the generalized non-commuting graphs of two -isoclinic pairs are isomorphic under some condition.
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.