Feedback vertex number of Sierpiński-type graphs

LiLi Yuan, Baoyindureng Wu, Biao Zhao

The feedback vertex number $\tau (G)$ of a graph $G$ is the minimum number of vertices that can be deleted from $G$ such that the resultant graph does not contain a cycle. We show that…