7 papers
Parameterized algorithms for representing graphs as intersections of threshold graphs
L. Sunil Chandran, Suraj Kumar Sahoo
A graph is called a threshold graph if there is an assignment of real valued weights to its vertices such that two vertices have an edge between them if and only if the sum of the…
The boxicity of the compressed zero divisor graph of the ring of integers modulo N
L. Sunil Chandran, Suraj Kumar Sahoo
The boxicity of a graph , denoted by , is the minimum integer such that is the intersection graph of axis-parallel boxes in . The class of ze…
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…
Off-diagonal Rado numbers for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
The study of Ramsey-type problems for linear equations originated with Schur's theorem and was later placed in a systematic framework by Richard Rado. In the off-diagonal setting,…
Localization: A Framework to Generalize Extremal Graph Problems
Rajat Adak, L. Sunil Chandran
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a f…
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…