13 citations · 52 across the 53 of their papers we have counts for
63 papers
Boxicity of Zero Divisor Graphs
L. Sunil Chandran, Suraj Kumar Sahoo
A -dimensional box is the cartesian product where each is a closed interval on the real line. The boxicity of a graph, denoted as , is…
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 such that can be represented as the intersection graph of axis-par…
-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.…
Graph-theoretic insights on the constructability of complex entangled states
L. Sunil Chandran, Rishikesh Gajjala
The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions w…
s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs
Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri +1
In this paper, we study the computational complexity of \textsc{-Club Cluster Vertex Deletion}. Given a graph, \textsc{-Club Cluster Vertex Deletion (-CVD)} aims to delete…