Relative non-commuting graph of a finite ring

Publication date 23 November 2018

Abstract: Let

S

be a subring of a finite ring

R

and

C_{R} (S) = r i n R : r s = s r; f o r a l l; s i n S

. The relative non-commuting graph of the subring

S

in

R

, denoted by

G a m m a_{S, R}

, is a simple undirected graph whose vertex set is

R s e t m i n u s C_{R} (S)

and two distinct vertices

a, b

are adjacent if and only if

a

or

b i n S

and

a b e q b a

. In this paper, we discuss some properties of

G a m m a_{S, R}

, determine diameter, girth, some dominating sets and chromatic index for

G a m m a_{S, R}

. Also, we derive some connections between

G a m m a_{S, R}

and the relative commuting probability of

S

in

R

. Finally, we show that the relative non-commuting graphs of two relative

-isoclinic pairs of rings are isomorphic under some conditions.

Recommendations

Cited in

(5)

This page was built for publication: Relative non-commuting graph of a finite ring