DEPTH OF BINOMIAL EDGE IDEALS IN TERMS OF DIAMETER AND VERTEX CONNECTIVITY

Authors

A. V. Jayanthan, Indian Institute of Technology Madras
Rajib Sarkar, Indian Statistical Institute, Kolkata

Article Type

Research Article

Publication Title

Journal of Commutative Algebra

Abstract

Let G be a simple connected noncomplete graph and JG be its binomial edge ideal in a polynomial ring S. Using certain invariants associated to graphs, say U(G), Banerjee and Núñez-Betancourt gave an upper bound for the depth of S/JG, and Rouzbahani Malayeri, Saeedi Madani and Kiani obtained a lower bound, say L(G). Hibi and Saeedi Madani gave a structural classification of graphs satisfying L(G) = U(G). In this article, we give structural classification of graphs satisfying L(G) + 1 = U(G). We also compute the depth of S/JG for all such graphs G.

First Page

411

Last Page

437

DOI

10.1216/jca.2024.16.411

Publication Date

1-1-2024

Comments

Open Access; Green Open Access

Recommended Citation

Jayanthan, A. V. and Sarkar, Rajib, "DEPTH OF BINOMIAL EDGE IDEALS IN TERMS OF DIAMETER AND VERTEX CONNECTIVITY" (2024). Journal Articles. 4702.
https://digitalcommons.isical.ac.in/journal-articles/4702