English

Relative non-commuting graph of a finite ring

Rings and Algebras 2017-05-08 v1

Abstract

Let SS be a subring of a finite ring RR and CR(S)={rR:rs=sr    sS}C_R(S) = \{r \in R : rs = sr \;\forall\; s \in S\}. The relative non-commuting graph of the subring SS in RR, denoted by ΓS,R\Gamma_{S, R}, is a simple undirected graph whose vertex set is RCR(S)R \setminus C_R(S) and two distinct vertices a,ba, b are adjacent if and only if aa or bSb \in S and abbaab \neq ba. In this paper, we discuss some properties of ΓS,R\Gamma_{S, R}, determine diameter, girth, some dominating sets and chromatic index for ΓS,R\Gamma_{S, R}. Also, we derive some connections between ΓS,R\Gamma_{S, R} and the relative commuting probability of SS in RR. Finally, we show that the relative non-commuting graphs of two relative Z\Z-isoclinic pairs of rings are isomorphic under some conditions.

Keywords

Cite

@article{arxiv.1705.02161,
  title  = {Relative non-commuting graph of a finite ring},
  author = {Jutirekha Dutta and Dhiren Kumar Basnet},
  journal= {arXiv preprint arXiv:1705.02161},
  year   = {2017}
}

Comments

9 pages