3 citations · 7 across the 13 of their papers we have counts for
Showing 2015 · cs.DMShow all
3 papers · 2 filters
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 , a {\em spanning tree} is a connected and an acyclic subgraph that spans all vertices of . 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 and a terminal set , {\em Steiner tree} asks for a tree that includes all of with at most edges for some integer . I…