A. Mohanapriya

collaborators

2 papers

cs.CC2022

On Convexity in Split graphs: Complexity of Steiner tree and Domination

A Mohanapriya, P Renjith, N Sadagopan

Given a graph $G$ with a terminal set $R \subseteq V (G)$ , the Steiner tree problem (STREE) asks for a set $S \subseteq V (G) ∖ R$ such that the graph induced on $S \cup R$ is…

cs.DM2021

Steiner Tree in $k$ -star Caterpillar Convex Bipartite Graphs -- A Dichotomy

Aneesh D H, A. Mohanapriya, P. Renjith +1

The class of $k$ -star caterpillar convex bipartite graphs generalizes the class of convex bipartite graphs. For a bipartite graph with partitions $X$ and $Y$ , we associate a $k$ -st…

On Convexity in Split graphs: Complexity of Steiner tree and Domination

Steiner Tree in k-star Caterpillar Convex Bipartite Graphs -- A Dichotomy

Steiner Tree in $k$ -star Caterpillar Convex Bipartite Graphs -- A Dichotomy