Vertex decomposability and regularity of very well-covered graphs

By M. Mahmoudi, A. Mousivand, Marilena Crupi, Giancarlo Rinaldo, Naoki Terai, Siamak Yassemi. 2010

86 citations recorded by the source corpus.

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.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Pharmacology

View Paper: https://www.semanticscholar.org/paper/8ac1be4eb68c89b5d5de14576f946db833cd2816

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Huy Tài Hà
  2. Arindam Banerjee
  3. K. Kimura
  4. Russ Woodroofe
  5. Selvi Kara
  6. Augustine O’Keefe
  7. Takayuki Hibi
  8. Akihiro Higashitani

In Computational Theory and Mathematics

  1. Huy Tài Hà
  2. K. Kimura
  3. Arindam Banerjee
  4. Russ Woodroofe
  5. Selvi Kara
  6. Takayuki Hibi
  7. Akihiro Higashitani
  8. Adam Van Tuyl

In Pharmacology

  1. Huy Tài Hà

Citations in the corpus