1 citations · 1 across the 10 of their papers we have counts for
6 papers · 1 filter
Eccentricity Shortest Path: the structural parameter landscape
Anand Babu, Ashwin Jacob, Hitendra Kumar +1
The Eccentricity Shortest Path problem asks, given a connected graph and a nonnegative integer , whether some shortest path is within distance of every vertex. We study its…
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S +1
A perfect Italian dominating function assigns a label from to each vertex so that the labels in the neighborhood of every zero-labeled vertex sum to exactly two. Althou…
On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs
Sourav Das, Ashwin Jacob, Arpit Kumar +1
In this paper, we study CONFLICT-FREE EDGE CUT (CF-CUT), which is a recently introduced conflict-free version of the MIN-CUT problem that asks to find the minimum number of edges t…
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…
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
Ashwin Jacob, Arpit Kumar, Diptapriyo Majumdar
Vertex deletion to the hereditary graph class has been well-studied in parameterized complexity. Vertex deletion in scattered graph classes has attracted attention in recent years.…
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…