L. Chandran

collaborators

3 papers

cs.DM2025

Boxicity of Zero Divisor Graphs

L. Sunil Chandran, Suraj Kumar Sahoo

A $d$ -dimensional box is the cartesian product $R_{i} \times \dots \times R_{d}$ where each $R_{i}$ is a closed interval on the real line. The boxicity of a graph, denoted as $b o x (G)$ , is…

math.CO2025

Boxicity and Cubicity of Divisor Graphs and Power Graphs

L. Sunil Chandran, Jinia Ghosh

The \textit{boxicity} (\textit{cubicity}) of an undirected graph $Γ$ is the smallest non-negative integer $k$ such that $Γ$ can be represented as the intersection graph of axis-par…

cs.DS2024

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