The unit graph of a left Artinian ring (Q2250819): Difference between revisions

The unit graph of a unitary ring \(R\) is a graph whose vertices are the elements of \(R\) and two distinct vertices \(r, s \in R\) are adjacent if and only if \(r+s\) is a unit in \(R\). The main result of the paper is: Corollary 3. Let \(R\) be a finite ring, \(| R| \geq 4\). Then the following are equivalent: (1) Every element of \(R\) is a sum of at most three units. (2) The factor \(R/J(R)\) has at most one summand isomorphic to \({\mathbb Z}_2\). (3) The unit graph of \(R\) is connected. (4) The unit graph of \(R\) is Hamiltonian. The authors, in fact, give an algorithm to find a Hamiltonian cycle whenever such a cycle exists. Furthermore, in Theorem~1 they prove the equivalence of (1), (2) and (3) for an arbitrary left Artinian ring. In addition, they determine the diameter and girth of the unit graph for left-Artinian rings.