B. S. Panda

most citedNP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DM2016

Some Algorithmic Results on Restrained Domination in Graphs

Arti Pandey, B. S. Panda

A set $D \subseteq V$ of a graph $G = (V, E)$ is called a restrained dominating set of $G$ if every vertex not in $D$ is adjacent to a vertex in $D$ and to a vertex in $V ∖ D$ .…

cs.DM2008★ 4 cited

NP-Completeness of Hamiltonian Cycle Problem on Rooted Directed Path Graphs

B. S. Panda, D. Pradhan

The Hamiltonian cycle problem is to decide whether a given graph has a Hamiltonian cycle. Bertossi and Bonuccelli (1986, Information Processing Letters, 23, 195-200) proved that th…