From the 1 of 5 linked papers with an AI index.
5 papers
Graph Burning: Bounds and Hardness
Dhanyamol Antony, L. Sunil Chandran, Anita Das +3
The paper studies the graph burning process, proving NP‑completeness for proper interval graphs, giving tight upper bounds for connected P_k‑free graphs, and analyzing edge and tot…
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…
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.…
Switching Classes: Characterization and Computation
Dhanyamol Antony, Yixin Cao, Sagartanu Pal +1
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class , we are concerned with the maximum…