Domination in commuting graph and its complement

preprint2016arXivOpen access

Abstract

For each non-commutative ring R, the commuting graph of R is a graph with vertex set R∖Z(R)R\setminus Z(R) and two vertices xx and yy are adjacent if and only if x≠yx\neq y and xy=yxxy=yx. In this paper, we consider the domination and signed domination numbers on commuting graph Γ(R)Γ(R) for non-commutative ring RR with Z(R)={0}Z(R)=\{0\}. For a finite ring RR, it is shown that γ(Γ(R))+γ(Γ‾(R))=∣R∣γ(Γ(R)) + γ(\overlineΓ(R))=|R| if and only if RR is non-commutative ring on 4 elements. Also we determine the domination number of Γ(∏i=1tRi)Γ(\prod_{i=1}^{t}R_i) and commuting graph of non-commutative ring RR of order p3p^3, where pp is prime. Moreover we present an upper bound for signed domination number of Γ(∏i=1tRi)Γ(\prod_{i=1}^{t}R_i).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.