Regularity and projective dimension of edge ideal of C₅-free vertex decomposable graphs
classification
🧮 math.AC
math.CO
keywords
graphsdecomposabledepthdimensionedgefreeidealinvariants
read the original abstract
In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where $c_G$ is the maximum number of 3-disjoint edges in $G$. Moreover for this class of graphs we characterize $\T{pd}(R/I(G))$ and $\T{depth}(R/I(G))$. As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.