Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram

output

20112026

most citedStudy of strongly nonlinear oscillators using the Aboodh transform and the homotopy perturbation method

32 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing cs.DMShow all

6 papers · 1 filter

cs.DM2016

The Hamiltonian Cycle in $K_{1, r}$ -free Split Graphs -- A Dichotomy

P. Renjith, N. Sadagopan

In this paper, we investigate the well-studied Hamiltonian cycle problem (HCYCLE), and present an interesting dichotomy result on split graphs. T. Akiyama et al. (1980) have shown…

cs.DM2016★ 2 cited

On strictly Chordality-k graphs

S. Dhanalakshmi, N. Sadagopan

Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are pre…

cs.DM2015★ 1 cited

2-Trees: Structural Insights and the study of Hamiltonian Paths

P. Renjith, N. Sadagopan

For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existenc…

cs.DM2015

Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view

K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan

For a connected labelled graph $G$ , a {\em spanning tree} $T$ is a connected and an acyclic subgraph that spans all vertices of $G$ . In this paper, we consider a classical combinat…

cs.DM2015★ 3 cited

Complexity of Steiner Tree in Split Graphs - Dichotomy Results

Madhu Illuri, P. Renjith, N. Sadagopan

Given a connected graph $G$ and a terminal set $R \subseteq V (G)$ , {\em Steiner tree} asks for a tree that includes all of $R$ with at most $r$ edges for some integer $r \geq 0$ . I…

cs.DM2011

On the Complexity of Connected $(s, t)$ -Vertex Separator

N. S. Narayanaswamy, N. Sadagopan

We show that minimum connected $(s, t)$ -vertex separator ( $(s, t)$ -CVS) is $Ω (l o g^{2 - ε} n)$ -hard for any $ε > 0$ unless NP has quasi-polynomial Las-Vegas algorithms. i.e., for any $ε > 0$ …

The Hamiltonian Cycle in K1,r​-free Split Graphs -- A Dichotomy