R Sarkar - International Journal of Algebra and Computation, 2021 - World Scientific
Let G be a connected graph on the vertex set [n]. Then depth (S/JG)≤ n+ 1. In this paper, we
prove that if G is a unicyclic graph, then the depth of S/JG is bounded below by n. Also, we …