The decycling numbers of graphs

S. Bau, L. W. Beineke

For a graph $G$ and $S\subset V(G)$, if $G-S$ is acyclic, then $S$ is said to be a decycling set of $G$. The size of a smallest decycling set of $G$ is called the decycling numbe…