112 citations · 112 across the 6 of their papers we have counts for
6 papers
Algorithms and Bounds for Very Strong Rainbow Coloring
L. Sunil Chandran, Anita Das, Davis Issac +1
A well-studied coloring problem is to assign colors to the edges of a graph so that, for every pair of vertices, all edges of at least one shortest path between them receive di…
Rainbow path and color degree in edge colored graphs
Anita Das, P. Suresh, S. V. Subrahmanya
Let be an edge colored graph. A {\it}{rainbow path} in is a path in which all the edges are colored with distinct colors. Let be the color degree of a vertex i…
Isoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
L. Sunil Chandran, Anita Das, Frank Ruskey
In this paper we demonstrate connections between three seemingly unrelated concepts. (1) The discrete isoperimetric problem in the infinite binary tree with all the leaves at the s…
Rainbow Connection Number and Connected Dominating Sets
L. Sunil Chandran, Anita Das, Deepak Rajendraprasad +1
Rainbow connection number rc(G) of a connected graph G is the minimum number of colours needed to colour the edges of G, so that every pair of vertices is connected by at least one…
On the cubicity of bipartite graphs
L. Sunil Chandran, Anita Das, Naveen Sivadasan
{\it A unit cube in -dimension (or a -cube) is defined as the cartesian product , where each is a closed interval on the real line…
Cubicity, Boxicity and Vertex Cover
L. Sunil Chandran, Anita Das, Chintan Shah
A -dimensional box is the cartesian product where each is a closed interval on the real line. The {\it boxicity} of a graph , den…