1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2016
Spanning Trees in 2-trees
P. Renjith, N. Sadagopan, Douglas B. West
A spanning tree of a graph is a connected acyclic spanning subgraph of . We consider enumeration of spanning trees when is a -tree, meaning that is obtained from…
cs.DM2014★ 1 cited
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
Vandhana. C, S. Hima Bindhu, P. Renjith +2
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator is minimal if it contains no other separator as…