A construction of sequentially Cohen-Macaulay graphs

From MaRDI portal



Abstract: For every simple graph G, a class of multiple clique cluster-whiskered graphs Gmd is introduced, and it is shown that all graphs Gmd are vertex decomposable, thus the independence simplicial complex mInd,Gmd is sequentially Cohen-Macaulay; the properties of the graphs Gmd and the clique-whiskered graph Gpi are studied, including the enumeration of facets of the complex mInd,Gpi and, the calculation of Betti numbers of the cover ideal Ic(Gmd).












This page was built for publication: A construction of sequentially Cohen-Macaulay graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002587)