A Characterization of Triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
arXiv:1508.07713 · doi:10.1007/s10801-015-0631-0
Abstract
We graph-theoretically characterize triangle-free Gorenstein graphs . As an application, we classify when is Cohen-Macaulay.
15 pages, to appear in JACO
Cited by in corpus (8)
- Trung's Construction and the Charney-Davis Conjecture
- Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four
- Gorenstein and Cohen-Macaulay Matching Complexes
- Well-covered Unitary Cayley Graphs of Matrix Rings over Finite Fields and Applications
- 1-well-covered graphs revisited
- On Gorenstein Circulant Graphs and Gorenstein SQC Graphs
- On the regularity of edge ideal of graphs
- Algebraic Properties of Clique Complexes of Line Graphs