5 papers · 1 filter
A Complete Classification of Discrete -Pseudomanifolds with at Most Vertices
Biplab Basak, Debolina Ghosh, Raju Kumar Gupta
A simple undirected graph is called a discrete -pseudomanifold if, for every vertex , the induced subgraph on the neighbors of is a discrete -pseudoma…
On the matching complexes of categorical product of path graphs
Raju Kumar Gupta, Sourav Sarkar, Sagar S. Sawant +1
The matching complex of a graph is a simplicial complex whose simplices are matchings in . These complexes appear in various places and found applications in…
On the Vietoris-Rips Complexes of Integer Lattices
Raju Kumar Gupta, Sourav Sarkar, Samir Shukla
For a metric space and , the Vietoris-Rips complex is a simplicial complex whose simplices are finite subsets of with diameter at most . Vi…
Average edge order of normal -pseudomanifolds
Biplab Basak, Raju Kumar Gupta
In their work [10], Feng Luo and Richard Stong introduced the concept of the average edge order, denoted as . They demonstrated that if for a clo…
A characterization of -minimal normal 3-pseudomanifolds with at most four singularities
Biplab Basak, Raju Kumar Gupta, Sourav Sarkar
Let be a -minimal normal 3-pseudomanifold. A vertex in whose link is not a sphere is called a singular vertex. When contains at most two singular vertices, its…