Vertex Dismissibility and Scalability of Simplicial Complexes
This paper introduces the concepts of vertex dismissible and scalable simplicial complexes as generalizations of vertex decomposability and shellability, establishing their algebraic characterizations via Alexander duality, proving their equivalence to weak connectedness for specific graph classes, and providing a unified skeletal framework that recovers numerous classical theorems.