English

Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs

Commutative Algebra 2016-01-05 v1 Combinatorics

Abstract

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers a(G)a'(G) and n(G)n(G) depending on graph GG and show that for a vertex decomposable graph GG, \reg(R/I(G))min{a(G),n(G)}\reg(R/I(G))\leq \min\{a'(G),n(G)\} and for a shellable graph GG, \reg(R/I(G))n(G)\reg(R/I(G))\leq n(G). Moreover it is shown that for a graph GG, where GcG^c is a dd-tree, we have \pd(R/I(G))=maxvV(G){degG(v)}\pd(R/I(G))=\max_{v\in V(G)} \{\deg_G(v)\}.

Keywords

Cite

@article{arxiv.1007.4056,
  title  = {Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs},
  author = {Somayeh Moradi and Dariush Kiani},
  journal= {arXiv preprint arXiv:1007.4056},
  year   = {2016}
}

Comments

11 pages