Deepak Rajendraprasad

2 citations · 4 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2024

Face-hitting Dominating Sets in Planar Graphs

P. Francis, Abraham M. Illickan, Lijo M. Jose +1

A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$ . A face-hitting set of a plane graph $G$ is a set $T$ …

math.CO2014

Separation dimension of bounded degree graphs

Noga Alon, Manu Basavaraju, L. Sunil Chandran +2

The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $R^{k}$ such that any pair of disjoint edges in…

math.CO2014★ 2 cited

Domination in designs

Felix Goldberg, Deepak Rajendraprasad, Rogers Mathew

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $γ (D)$ the domination number of the incidence…

math.CO2014

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad

The boxicity (respectively cubicity) of a graph $G$ is the minimum non-negative integer $k$ , such that $G$ can be represented as an intersection graph of axis-parallel $k$ -dimensio…

math.CO2014★ 1 cited

Separation dimension of sparse graphs

Manu Basavaraju, L. Sunil Chandran, Rogers Mathew +1

The separation dimension of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $R^{k}$ such that any pair of disjoint edges in $…

math.CO2014★ 1 cited

Partial list colouring of certain graphs

Jeannette Janssen, Rogers Mathew, Deepak Rajendraprasad

Let $G$ be a graph on $n$ vertices and let $L_{k}$ be an arbitrary function that assigns each vertex in $G$ a list of $k$ colours. Then $G$ is $L_{k}$ -list colourab…