Relative non-commuting graph of a finite ring
Rings and Algebras
2017-05-08 v1
Abstract
Let be a subring of a finite ring and . The relative non-commuting graph of the subring in , denoted by , is a simple undirected graph whose vertex set is and two distinct vertices are adjacent if and only if or and . In this paper, we discuss some properties of , determine diameter, girth, some dominating sets and chromatic index for . Also, we derive some connections between and the relative commuting probability of in . Finally, we show that the relative non-commuting graphs of two relative -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