D. Rajendraprasad

activity

20102024

most citedRainbow Connection Number and Connected Dominating Sets

112 citations · 144 across the 30 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

B $_{0}$ -VPG Representation of AT-free Outerplanar Graphs

Sparsh Jain, Sreejith K. Pallathumadam, Deepak Rajendraprasad

A $k$ -bend path is a non-self-intersecting polyline in the plane made of at most $k + 1$ axis-parallel line segments. B $_{k}$ -VPG is the class of graphs which can be represented as int…

math.CO2022

Disjoint Total Dominating Sets in Near-Triangulations

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

We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulati…

B0​-VPG Representation of AT-free Outerplanar Graphs

Disjoint Total Dominating Sets in Near-Triangulations

B $_{0}$ -VPG Representation of AT-free Outerplanar Graphs