6 citations · 16 across the 10 of their papers we have counts for
6 papers · 1 filter
On a complete characterization of path-free complexes associated with complete multipartite graphs
Priyavrat Deshpande, Shuchita Goyal, Rutuja Sawant
Let be a graph and let $\PF_t(G)$ denote the simplicial complex whose faces are vertex subsets whose induced subgraphs contain no path on vertices. These complexes encode a…
Chordal graphs, higher independence and vertex decomposable complexes
Fred M. Abdelmalek, Priyavrat Deshpande, Shuchita Goyal +2
Given a simple undirected graph there is a simplicial complex , called the independence complex, whose faces correspond to the independent sets of . This is…
Matching complexes of grid graphs
Shuchita Goyal, Samir Shukla, Anurag Singh
The matching complex of a graph is a simplicial complex whose simplices are matchings in . In the last few years the matching complexes of grid graphs have gained much atten…
Topology of Clique Complexes of Line Graphs
Shuchita Goyal, Samir Shukla, Anurag Singh
The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the…
Homotopy Type of Independence Complexes of Certain Families of Graphs
Shuchita Goyal, Samir Shukla, Anurag Singh
We show that the independence complexes of generalised Mycielskian of complete graphs are homotopy equivalent to a wedge sum of spheres, and determine the number of copies and the…
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…