L. Chandran

activity

20052026

most citedRainbow Connection Number and Radius

13 citations · 52 across the 53 of their papers we have counts for

collaborators

Showing 2011 · math.COShow all

4 papers · 2 filters

math.CO2011★ 2 cited

Bipartite powers of k-chordal graphs

L. Sunil Chandran, Rogers Mathew

Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are pre…

math.CO2011

On Rainbow Connection Number and Connectivity

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

Rainbow connection number, $r c (G)$ , of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least on…

math.CO2011★ 4 cited

Cubicity, Degeneracy, and Crossing Number

Abhijin Adiga, L. Sunil Chandran, Rogers Mathew

A $k$ -box $B = (R_{1}, ..., R_{k})$ , where each $R_{i}$ is a closed interval on the real line, is defined to be the Cartesian product $R_{1} \times R_{2} \times ... \times R_{k}$ . If each $R_{i}$ is a…

math.CO2011★ 1 cited

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…