A Complete Classification of Discrete $d$-Pseudomanifolds with at Most $2d+7$ Vertices

Biplab Basak, Debolina Ghosh, Raju Kumar Gupta

A simple undirected graph $M$ is called a discrete $d$-pseudomanifold if, for every vertex $v$, the induced subgraph $N_M(v)$ on the neighbors of $v$ is a discrete $(d-1)$-pseudoma…