N. Sadagopan

activity

20152026

most citedComplexity of Steiner Tree in Split Graphs - Dichotomy Results

3 citations · 6 across the 11 of their papers we have counts for

collaborators

Showing 2016Show all

2 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

Spanning Trees in 2-trees

P. Renjith, N. Sadagopan, Douglas B. West

A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$ . We consider enumeration of spanning trees when $G$ is a $2$ -tree, meaning that $G$ is obtained from…

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

Spanning Trees in 2-trees

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