paper

Cohen-Macaulayness of Total Simplicial Complexes

arXiv:2310.09966

Abstract

We first construct the total simplicial complex (TSC) of a finite simple graph in order to generalize the total graph . We show that is not Cohen-Macaulay (CM) in general. For a connected graph , we prove that the TSC is Buchsbaum. We demonstrate that the vanishing of first homology group of TSC associated to a connected graph is both a necessary and sufficient condition for it to be CM. We find the primary decomposition of the TSC associated to a family of friendship graphs and prove it to be CM.

18 Pages

Cohen-Macaulayness of Total Simplicial Complexes · wovepaper