Linear Residuals and Gallai-Simplicial Complexes
Abstract
In this paper, we give a new algebraic criterion for the shellability of (non-pure) simplicial complex over [n], shellable in the sense of Bj\"orner and Wachs BW. We show that the spanning simplicial complex of doubly uni-cyclic graph is non-pure shellable. Moreover, we introduce the concept of Gallai-simplicial complex (G) of a finite simple graph G. We applied the obtained criterion to discuss the shellability of Gallai simplicial complexes associated to various classes of graphs..
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.