A construction of sequentially Cohen-Macaulay graphs
From MaRDI portal
Abstract: For every simple graph , a class of multiple clique cluster-whiskered graphs is introduced, and it is shown that all graphs are vertex decomposable, thus the independence simplicial complex is sequentially Cohen-Macaulay; the properties of the graphs and the clique-whiskered graph are studied, including the enumeration of facets of the complex and, the calculation of Betti numbers of the cover ideal .
Recommendations
Cited in
(9)- On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences
- Cohen-Macaulay growing graphs
- Constructing vertex decomposable graphs
- On the constructions of sequential graphs
- Whiskers and sequentially Cohen-Macaulay graphs
- A new construction for Cohen-Macaulay graphs
- A new construction for vertex decomposable graphs
- Sequentially Cohen-Macaulay graphs of form \(\theta_{n_1,\dots,n_k}\)
- Line graphs with a Cohen-Macaulay or Gorenstein clique complex
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)