Vertex decomposability and regularity of very well-covered graphs

58Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A graph is called very well-covered if it is unmixed without isolated vertices such that the cardinality of each minimal vertex cover is half the number of vertices. We first prove that a very well-covered graph is Cohen-Macaulay if and only if it is vertex decomposable. Next, we show that the Castelnuovo-Mumford regularity of the quotient ring of the edge ideal of a very well-covered graph is equal to the maximum number of pairwise 3-disjoint edges. © 2011 Elsevier B.V.

Cite

CITATION STYLE

APA

Mahmoudi, M., Mousivand, A., Crupi, M., Rinaldo, G., Terai, N., & Yassemi, S. (2011). Vertex decomposability and regularity of very well-covered graphs. Journal of Pure and Applied Algebra, 215(10), 2473–2480. https://doi.org/10.1016/j.jpaa.2011.02.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free