2 citations · 5 across the 9 of their papers we have counts for
9 papers
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
Jasine Babu, Ajay Saju Jacob, R. Krithika +1
We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).
An Improvement to Chvátal and Thomassen's Upper Bound for Oriented Diameter
Jasine Babu, Deepu Benson, Deepak Rajendraprasad +1
An orientation of an undirected graph is an assignment of exactly one direction to each edge of . The oriented diameter of a graph is the smallest diameter among all the…
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…
Separation dimension of bounded degree graphs
Noga Alon, Manu Basavaraju, L. Sunil Chandran +2
The 'separation dimension' of a graph is the smallest natural number for which the vertices of can be embedded in such that any pair of disjoint edges in…
Domination in designs
Felix Goldberg, Deepak Rajendraprasad, Rogers Mathew
We commence the study of domination in the incidence graphs of combinatorial designs. Let be a combinatorial design and denote by the domination number of the incidence…
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 is the minimum non-negative integer , such that can be represented as an intersection graph of axis-parallel -dimensio…