Abstract

Let R be a commutative ring with non-zero identity and J(R) be Jacobson ideal of R. The Jacobson graph of R is the graph whose vertices are \(R{\setminus } 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. We investigate diameter of \(\mathfrak {J}_R\) and seek relation between it and diameter of Jacobson graphs under extension to polynomial and power series rings. Also, vertex and edge connectivity of finite Jacobson graphs are obtained. Finally, we show 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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.