2000 character limit reached
Sum-Essential Graphs of Modules
Published 16 Aug 2019 in math.RA and math.CO | (1908.05921v1)
Abstract: The sum-essential graph $ \mathcal{S}_R(M) $ of a left $R$-module $M$ is a graph whose vertices are all nontrivial submodules of $M$ and two distinct submodules are adjacent iff their sum is an essential submodule of $M$. Properties of the graph $\mathcal{S}_R(M)$ and its subgraph $\mathcal{P}_R(M)$ induced by vertices which are not essential as submodules of $M$ are investigated. The interplay between module properties of $M$ and properties of those graphs is studied.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.