112 citations · 144 across the 30 of their papers we have counts for
7 papers · 1 filter
Oriented Diameter of Star Graphs
K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep
An {\em orientation} of an undirected graph is an assignment of exactly one direction to each edge of . Converting two-way traffic networks to one-way traffic networks and b…
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…
Rainbow Colouring of Split Graphs
L. Sunil Chandran, Deepak Rajendraprasad, Marek Tesař
A rainbow path in an edge coloured graph is a path in which no two edges are coloured the same. A rainbow colouring of a connected graph G is a colouring of the edges of G such tha…
Approximating the Cubicity of Trees
Jasine Babu, Manu Basavaraju, L Sunil Chandran +2
Cubicity of a graph is the smallest dimension , for which is a unit disc graph in , under the metric, i.e. can be represented as an inters…
2-connecting Outerplanar Graphs without Blowing Up the Pathwidth
Jasine Babu, Manu Basavaraju, L. Sunil Chandran +1
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p…