Comaximal graph of commutative rings
Abstract
Let R be a commutative ring with identity. Let (R) be a graph with vertices as elements of R, where two distinct vertices a and b are adjacent if and only if Ra+Rb=R. In this paper we consider a subgraph 2(R) of (R) which consists of non-unit elements. We look at the connectedness and the diameter of this graph. We completely characterize the diameter of the graph 2(R)(R). In addition, it is shown that for two finite semi-local rings R and S, if R is reduced, then (R)(S) if and only if R S.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.