4 citations · 6 across the 12 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Stronger Spectral Bound for Clique Number
Hareshkumar Jadav, Sudipta Mallik, Akhilesh Panchangam +1
Given an integer , deciding whether a graph has a clique of size is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a grap…
math.CO2026
Combinatorial formula for the Moore-Penrose inverse of the complex signless Laplacian of an oriented graph
XiaoYang Liu, Sudipta Mallik, Anh Tang
We find necessary and sufficient conditions for the rank of the signless incidence matrix of a weakly connected oriented graph with non-zero complex edge weights. We use this to fi…