1 citations · 1 across the 10 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
Improved bounds for the lazy cops and robbers on generalized hypercubes
Anand Babu, Ashwin Jacob, Karunakaran Murali Krishnan +2
In Lazy Cops and Robbers, at most one cop moves on each cop turn. We study the lazy cop number of the generalized hypercube , whose vertex set is . Fo…
math.CO2026
A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
Anand Babu, Ashwin Jacob
The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs needed to partition the edge set of . Lyu and Hick…
math.CO2025
Exact Biclique Partition number of Split Graphs
Anand Babu, Ashwin Jacob
The biclique partition number of a graph \(G\), denoted \( \operatorname{bp}(G)\), is the minimum number of biclique subgraphs that partition the edge set of \(G\). The Graham-Poll…