Some Cohen-Macaulay and unmixed binomial edge ideals
Commutative Algebra
2015-06-04 v1 Combinatorics
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'.
Cite
@article{arxiv.1506.01362,
title = {Some Cohen-Macaulay and unmixed binomial edge ideals},
author = {Dariush Kiani and Sara Saeedi Madani},
journal= {arXiv preprint arXiv:1506.01362},
year = {2015}
}
Comments
16 pages, 5 figures, to appear in Communications in Algebra