FEEDBACK NUMBERS OF FLOWER SNARK AND RELATED GRAPHS
S. Zhang, Xirong Xu, C. Liu, Yixin Yang · International Journal of Pure and Apllied Mathematics · 2014
A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph.The minimum cardinality of a feedback vertex set is called the feedback number.In this paper, we investigate the feedback number of flower snark and related graphs H n .Let f (H n ) denote the feedback number of H n , we prove that f (H n ) = n + 1 f or n ≥ 3.