16 citations · 28 across the 13 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2022
Bounds for the collapsibility number of a simplicial complex and non-cover complexes of hypergraphs
Rekha Santhanam, Samir Shukla, Anurag Singh
The collapsibility number of simplicial complexes was introduced by Wegner in order to understand the intersection patterns of convex sets. This number also plays an important role…
math.CO2020
Vertex cut of a graph and connectivity of its neighbourhood complex
Rekha Santhanam, Samir Shukla
We show that if a graph satisfies certain conditions then the connectivity of neighbourhood complex is strictly less than the vertex connectivity of . As an…
math.CO2016★ 1 cited
Lovász' original lower bound: Getting tighter bounds and Reducing computational complexity
Shuchita Goyal, Rekha Santhanam
In this article, we give conditions on a graph under which the Lovász' original bound of the graph can be improved by increasing the topological connectivity of its neighbourhood c…