14 citations · 14 across the 5 of their papers we have counts for
1 paper · 1 filter
Hareshkumar Jadav, Sudipta Mallik, Akhilesh Panchangam +1
Given an integer k, deciding whether a graph has a clique of size k is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a grap…