P. Renjith

activity

20172026

most citedHamiltonian Path in Split Graphs- a Dichotomy

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

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DM2026

A Fine-Grained Complexity of Co-Secure Domination for Some Subclasses of Chordal Graphs

Manjusha M S, Renjith P

For a connected graph $G = (V, E)$ , a set $D \subseteq V$ is a co-secure dominating set if $D$ is a dominating set of $G$ and for each vertex $u \in D$ there exists a vertex $v \in…

cs.DM2026

Short Cycles Decide P-versus-NPC Status ofHamiltonicity on Bisplit Graphs

Mahendra Kumar R, Renjith P, Aadhavan S +1

A connected graph G is said to be a bisplit graph if the vertex set of G can be partitioned into a stable set and a complete bipartite graph. We establish the following dichotomy w…