6 citations · 7 across the 3 of their papers we have counts for
4 papers
Pairwise Suitable Family of Permutations and Boxicity
Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1
A family F of permutations of the vertices of a hypergraph H is called "pairwise suitable" for H if, for every pair of disjoint edges in H, there exists a permutation in F in which…
Product Dimension of Forests and Bounded Treewidth Graphs
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad +1
The product dimension of a graph G is defined as the minimum natural number l such that G is an induced subgraph of a direct product of l complete graphs. In this paper we study th…
On Rainbow Connection Number and Connectivity
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Rainbow connection number, , of a connected graph is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least on…
Rainbow Connection Number of Graph Power and Graph Products
Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad +1
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path…