Vertex decomposability and regularity of very well-covered graphs
arXiv:1006.1087
Abstract
A graph 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 , the graph 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 is Cohen-Macaulay if and only if it is pure shellable. In this article we improve this result by showing that is Cohen-Macaulay if and only if it is pure vertex decomposable. In addition, if denotes the edge ideal of , we show that the Castelnuovo-Mumford regularity of is equal to the maximum number of pairwise 3-disjoint edges of . This improves Kummini's result on unmixed bipartite graphs.
11 pages