4 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…
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…
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.…