Depth of Binomial Edge Ideals in terms of Diameter and Vertex Connectivity

arXiv2112.04835MaRDI QIDQ6505280FDOQ6505280

Authors: A. V. Jayanthan, Rajib Sarkar 

Abstract: Let $G$ be a simple connected non-complete graph on $n$ vertices and $J_G$ be its binomial edge ideal. It is known that $f(G)+d(G)leqdepth(S/J_G)leqn+2-kappa(G)$, where $d(G)$ denotes the diameter, $f(G)$ denotes the number of simplicial vertices and $kappa(G)$ denotes the graph connectivity of $G$. Hibi and Saeedi Madani characterized $G$ such that $f(G)+d(G)=n+2-kappa(G)$. In this article, we characterize graphs $G$ such that $f(G)+d(G)+1=n+2-kappa(G)$ and compute the depth of $S/J_G$ for all such $G$.

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Syzygies, resolutions, complexes and commutative rings (13D02) Other special types of modules and ideals in commutative rings (13C13)

This page was built for publication: Depth of Binomial Edge Ideals in terms of Diameter and Vertex Connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505280)