Domination in commuting graph and its complement

Publication date 14 February 2018

Abstract: For each non-commutative ring R, the commuting graph of R is a graph with vertex set

R s e t m i n u s Z (R)

and two vertices

x

and

y

are adjacent if and only if

x e q y

and

x y = y x

. In this paper, we consider the domination and signed domination numbers on commuting graph

G a m m a (R)

for non-commutative ring

R

with

Z (R) = 0

. For a finite ring

R

, it is shown that

g a m m a (G a m m a (R)) + g a m m a (o v e r l i n e G a m m a (R)) = | R |

if and only if

R

is non-commutative ring on 4 elements. Also we determine the domination number of

G a m m a (p r o d_{i = 1}^{t} R_{i})

and commuting graph of non-commutative ring

R

of order

p^{3}

, where

p

is prime. Moreover we present an upper bound for signed domination number of

G a m m a (p r o d_{i = 1}^{t} R_{i})

.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Domination in commuting graph and its complement