1 citations · 2 across the 5 of their papers we have counts for
6 papers
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…
Hamiltonicity in Convex Bipartite Graphs
P. Kowsika, V. Divya, N. Sadagopan
For a connected graph, the Hamiltonian cycle (path) is a simple cycle (path) that spans all the vertices in the graph. It is known from \cite{muller,garey} that HAMILTONIAN CYCLE (…
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…
Hamiltonian Path in Split Graphs- a Dichotomy
P. Renjith, N. Sadagopan
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep in…
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
Kona Harshita, Sounaka Mishra, Renjith. P +1
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems…