Some results on the Jacobson graph of a commutative ring (Q1743839)

Let \(R\) be a commutative ring with non-zero identity and \(J(R)\) be Jacobson radical of \(R\). The Jacobson graph of \(R\), denoted by \(\mathfrak{J}_R\), is the graph whose vertices are \(R - J(R)\), and two different vertices \(x\) and \(y\) are adjacent if \(1 - xy \notin U(R)\), where \(U(R)\) is the set of units of \(R\). The authors investigate some properties of this graph. It is shown that in the case of a nonlocal ring, the distance between two units is at most 2 and the diameter of \(\mathfrak{J}_R\) is at most 5. A characterization for \(\mathfrak{J}_R\) to be a complete graph is proved. The following results are proved. Theorem. \(\mathfrak{J}_R\) is complete if and only if \(\mathfrak{J}_{R[x]}\) is complete, where \(R[x]\) is the polynomial ring over \(R\). Theorem. Let \(R\) and \(S\) be two rings and there exist a bijection between \(J(R)\) and \(J(S)\). Then \(\mathfrak{J}_R\) and \(\mathfrak{J}_S\) are isomorphic if and only if \(\mathfrak{J}_{R[[x]]}\) and \(\mathfrak{J}_{S[[x]]}\) are isomorphic (where \(R[{x]}\) denotes the power series ring over \(R\)). Also, vertex and edge connectivity of finite Jacobson graphs are obtained. It is also shown that all finite Jacobson graphs have a matching that misses at most one vertex and offer one 1-factor decomposition of a regular induced subgraph.