Abstract

Let M be a module over a commutative ring R. The annihilating-submodule graph of M, denoted by AG(M), is a simple graph in which a non-zero submodule N of M is a vertex if and only if there exists a non-zero proper submodule K of M such that N K = (0), where N K, the product of N and K, is denoted by (N : M)(K : M)M and two distinct vertices N and K are adjacent if and only if N K = (0). This graph is a submodule version of the annihilating-ideal graph. We prove that if AG(M) is a tree, then either AG(M) is a star graph or a path of order 4 and in the latter case $${M\cong F \times S}$$ , where F is a simple module and S is a module with a unique non-trivial submodule. Moreover, we prove that if M is a cyclic module with at least three minimal prime submodules, then gr(AG(M)) = 3 and for every cyclic module M, $${cl({\rm AG}(M)) \geq |{\rm Min}(M)|}$$ .

Highlights

  • Throughout this paper, R is a commutative ring with a non-zero identity and M is a unital R-module

  • By N ≤ M we mean that N is a submodule of M

  • In Corollary 3.7, we prove that if M is a cyclic module with at least three minimal prime submodules, gr (AG(M)) = 3 and for every cyclic module M, cl(AG(M)) ≥ |Min(M)|

Read more

Summary

Introduction

Throughout this paper, R is a commutative ring with a non-zero identity and M is a unital R-module. We may assume that M is not a vertex of AG(M), and by [7, Theorem 3.3], M is not a prime module. Theorem 2.11 If M is a cyclic module, Ann(M) is a nil ideal, and |Min(M)| ≥ 3, AG(M) contains a cycle.

Results
Conclusion

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.