P. Renjith

activity

20142021

most citedSpanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective

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

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2021

Hamiltonicity: Variants and Generalization in $P_{5}$ -free Chordal Bipartite graphs

S. Aadhavan, R. Mahendra Kumar, P. Renjith +1

A bipartite graph is chordal bipartite if every cycle of length at least six has a chord in it. M $u ¨$ ller \cite {muller1996Hamiltonian} has shown that the Hamiltonian cyc…

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…

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 $S$ is minimal if it contains no other separator as…

Hamiltonicity: Variants and Generalization in P5​-free Chordal Bipartite graphs

Spanning Trees in 2-trees

Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective

Hamiltonicity: Variants and Generalization in $P_{5}$ -free Chordal Bipartite graphs