Some Cohen–Macaulay and Unmixed Binomial Edge Ideals
Authors:
- 24 August 2015
- journal article
- research article
- Published by Taylor & Francis in Communications in Algebra
- Vol. 43 (12) , 5434-5453
Abstract
We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose binomial edge ideals are Cohen–Macaulay and unmixed. So that we generalize the results of Ene, Herzog, and Hibi on block graphs. Moreover, we study unmixedness and Cohen–Macaulayness of the binomial edge ideal of some graph products such as the join and corona of two graphs with respect to the original graphs.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Binomial edge ideals with pure resolutionsCollectanea Mathematica, 2014
- The binomial edge ideal of a pair of graphsNagoya Mathematical Journal, 2014
- Binomial Edge Ideals of Complete Multipartite GraphsCommunications in Algebra, 2013
- On The Binomial Edge Ideal of a Pair of GraphsThe Electronic Journal of Combinatorics, 2013
- Binomial Edge Ideals of GraphsThe Electronic Journal of Combinatorics, 2012
- Cohen-Macaulay binomial edge idealsNagoya Mathematical Journal, 2011
- Graphs and Ideals Generated by Some 2-MinorsCommunications in Algebra, 2011
- Binomial edge ideals and conditional independence statementsAdvances in Applied Mathematics, 2010
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961