Domination in commuting graph and its complement
Abstract
For each non-commutative ring R, the commuting graph of R is a graph with vertex set R Z(R) and two vertices x and y are adjacent if and only if x≠ y and xy=yx. In this paper, we consider the domination and signed domination numbers on commuting graph (R) for non-commutative ring R with Z(R)=\0\. For a finite ring R, it is shown that γ((R)) + γ((R))=|R| if and only if R is non-commutative ring on 4 elements. Also we determine the domination number of (Πi=1tRi) and commuting graph of non-commutative ring R of order p3, where p is prime. Moreover we present an upper bound for signed domination number of (Πi=1tRi).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.