3 citations · 7 across the 13 of their papers we have counts for
14 papers
Perfect Italian Domination on and Near Split Graphs: Algorithms, Hardness, and Approximation
Anand Babu N B, Ashwin Jacob, Manjusha M S +1
A perfect Italian dominating function assigns a label from to each vertex so that the labels in the neighborhood of every zero-labeled vertex sum to exactly two. Althou…
A Fine-Grained Complexity of Co-Secure Domination for Some Subclasses of Chordal Graphs
Manjusha M S, Renjith P
For a connected graph , a set is a co-secure dominating set if is a dominating set of and for each vertex there exists a vertex $v \in…
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…
On Convexity in Split graphs: Complexity of Steiner tree and Domination
A Mohanapriya, P Renjith, N Sadagopan
Given a graph with a terminal set , the Steiner tree problem (STREE) asks for a set such that the graph induced on is…
Steiner Tree in -star Caterpillar Convex Bipartite Graphs -- A Dichotomy
Aneesh D H, A. Mohanapriya, P. Renjith +1
The class of -star caterpillar convex bipartite graphs generalizes the class of convex bipartite graphs. For a bipartite graph with partitions and , we associate a -st…
On -free Chordal bipartite graphs
S Aadhavan, P Renjith, N Sadagopan
A bipartite graph is chordal bipartite if every cycle of length at least 6 has a chord in it. In this paper, we investigate the structure of -free chordal bipartite graphs and…