Cohen-Macaulayness of Total Simplicial Complexes

Abstract

We first construct the total simplicial complex (TSC) of a finite simple graph G in order to generalize the total graph T(G). We show that T(G) is not Cohen-Macaulay (CM) in general. For a connected graph G, we prove that the TSC is Buchsbaum. We demonstrate that the vanishing of first homology group of TSC associated to a connected graph G 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 F5n+1 and prove it to be CM.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…