RSA
2002
14 years 4 days ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...