Vertex decomposability and regularity of very well-covered graphs

Details Vertex decomposability and regularity of very well-covered graphs Vertex decomposability and regularity of very well-covered graphs

2010-06-06

arxiv.org/abs/1006.1087v1

Mathematics

Commutative Algebra

11 pages

Scientific paper

A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class of very well-covered graphs contains bipartite well-covered graphs. Recently in \cite{CRT} it is shown that a very well-covered graph $G$ is Cohen-Macaulay if and only if it is pure shellable. In this article we improve this result by showing that $G$ is Cohen-Macaulay if and only if it is pure vertex decomposable. In addition, if $I(G)$ denotes the edge ideal of $G$, we show that the Castelnuovo-Mumford regularity of $R/I(G)$ is equal to the maximum number of pairwise 3-disjoint edges of $G$. This improves Kummini's result on unmixed bipartite graphs.

Affiliated with

Also associated with

No associations

Rating

Vertex decomposability and regularity of very well-covered graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertex decomposability and regularity of very well-covered graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex decomposability and regularity of very well-covered graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-681924