13 citations · 52 across the 53 of their papers we have counts for
16 papers · 1 filter
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…
-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…
Edge-coloured graphs with only monochromatic perfect matchings and their connection to quantum physics
L. Sunil Chandran, Rishikesh Gajjala
Krenn, Gu and Zeilinger initiated the study of PMValid edge-colourings because of its connection to a problem from quantum physics. A graph is defined to have a PMValid -edge-co…
Improved Approximation for Maximum Edge Colouring Problem
L Sunil Chandran, Abhiruk Lahiri, Nitin Singh
The anti-Ramsey number, is the minimum integer such that in any edge colouring of with colours there is a rainbow subgraph isomorphic to , i.e., a copy of…
On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number Coincide
Jasine Babu, L. Sunil Chandran, Mathew Francis +3
The eternal vertex cover problem is a variant of the classical vertex cover problem where a set of guards on the vertices have to be dynamically reconfigured from one vertex cover…
New bounds on the anti-Ramsey numbers of star graphs
L. Sunil Chandran, Talha Hashim, Dalu Jacob +3
The anti-Ramsey number with input graph and pattern graph , is the maximum positive integer such that there exists an edge coloring of using colors, in…