Cohen-Macaulayness of Total Simplicial Complexes
Combinatorics
2023-10-17 v1 Algebraic Topology
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.
Cite
@article{arxiv.2310.09966,
title = {Cohen-Macaulayness of Total Simplicial Complexes},
author = {Najam Ul Abbas and Imran Ahmed and Ayesha Kiran},
journal= {arXiv preprint arXiv:2310.09966},
year = {2023}
}
Comments
18 Pages