Domination in commuting graph and its complement
Ebrahim Vatandoost, Yasser Golkhandy Pour

TL;DR
This paper investigates the domination and signed domination numbers of commuting graphs of non-commutative rings, providing specific results for rings of order four, prime cube, and products of rings, along with bounds for signed domination.
Contribution
It characterizes the domination sum for finite non-commutative rings and determines domination numbers for specific ring classes, introducing new bounds and exact values.
Findings
For rings of order four, the domination sum equals the ring size.
Domination number of product rings is explicitly determined.
Upper bounds for signed domination numbers are established.
Abstract
For each non-commutative ring R, the commuting graph of R is a graph with vertex set and two vertices and are adjacent if and only if and . In this paper, we consider the domination and signed domination numbers on commuting graph for non-commutative ring with . For a finite ring , it is shown that if and only if is non-commutative ring on 4 elements. Also we determine the domination number of and commuting graph of non-commutative ring of order , where is prime. Moreover we present an upper bound for signed domination number of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
