5 citations · 9 across the 17 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018
Neighborhood complexes, homotopy test graphs and a contribution to a conjecture of Hedetniemi
Samir Shukla
The neighborhood complex of a graph were introduced by L. Lov{á}sz in his proof of Kneser conjecture. He proved that for any graph , \begin{align} \label{abstract} χ…
math.CO2018
Spectral gap bounds for the simplicial Laplacian and an application to random complexes
Samir Shukla, D. Yogeshwaran
In this article, we derive two spectral gap bounds for the reduced Laplacian of a general simplicial complex. Our two bounds are proven by comparing a simplicial complex in two dif…
math.CO2018
Homotopy type of the neighborhood complexes of graphs of maximal degree at most and -regular circulant graphs
Samir Shukla
To estimate the lower bound for the chromatic number of a graph , Lovász associated a simplicial complex called the neighborhood complex and relates the topolog…