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

preprint2010arXivOpen access

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))\leq \min\{a'(G),n(G)\}$ and for a shellable graph GG, $\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))=\max_{v\in V(G)} \{°_G(v)\}$.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.