4 citations · 4 across the 10 of their papers we have counts for
11 papers
Hardness of Burning Number Problem on Regular Graphs
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
The Burning Number Problem (BNP) models the spread of information or contagion in a network through a discrete-time process on a graph. At each step, one new vertex is selected as…
Parameterized algorithms for -Inversion
Dhanyamol Antony, L. Sunil Chandran, Dalu Jacob +1
Inversion of a directed graph with respect to a vertex subset is the directed graph obtained from by reversing the direction of every arc whose endpoints both lie in $Y…
Graph Burning: Bounds and Hardness
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
Graph burning is a discrete-time process that models the propagation of information in a network. Given an undirected graph whose vertices are initially unburned, the process evolv…
Spanning caterpillar in biconvex bipartite graphs
Dhanyamol Antony, Anita Das, Shirish Gosavi +2
A bipartite graph is said to be a biconvex bipartite graph if there exist orderings in and in such that the neighbors of every vertex in are c…
-binding functions for squares of bipartite graphs and its subclasses
Dibyayan Chakraborty, L. Sunil Chandran, Dalu Jacob +1
A class of graphs is -bounded if there exists a function such that for each graph , where and are the chro…
Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
Dhanyamol Antony, L. Sunil Chandran, Ankit Gayen +2
Domination and coloring are two classic problems in graph theory. The major focus of this paper is the CD-COLORING problem which combines the flavours of domination and colouring.…
On the Kernel and Related Problems in Interval Digraphs
Mathew C. Francis, Pavol Hell, Dalu Jacob
Given a digraph , a set is said to be absorbing set (resp. dominating set) if every vertex in the graph is either in or is an in-neighbour (resp. out-neigh…
The Lexicographic Method for the Threshold Cover Problem
Mathew C. Francis, Dalu Jacob
Threshold graphs are a class of graphs that have many equivalent definitions and have applications in integer programming and set packing problems. A graph is said to have a thresh…
New bounds on the anti-Ramsey numbers of star graphs
L. Sunil Chandran, Talha Hashim, Dalu Jacob +3
The anti-Ramsey number with input graph and pattern graph , is the maximum positive integer such that there exists an edge coloring of using colors, in…
Extending some results on the second neighborhood conjecture
Suresh Dara, Mathew C. Francis, Dalu Jacob +1
A vertex in a directed graph is said to have a large second neighborhood if it has at least as many second out-neighbors as out-neighbors. The Second Neighborhood Conjecture, first…
Uniquely Restricted Matchings in Interval Graphs
Mathew C. Francis, Dalu Jacob, Satyabrata Jana
A matching in a graph is said to be uniquely restricted if there is no other matching in that matches the same set of vertices as . We describe a polynomial-time alg…