Author:
Zhang Xinyue,Wang Yijin,Zhang Sijia
Abstract
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 determine the exact values of the feedback numbers of the Goldberg snarks Gn and its related graphs Gn*, Twisted Goldberg Snarks TGn and its related graphs TGn*. Let f(n) denote the feedback numbers of these graphs, we prove that f(n)=2n+1, for n≥3.
Reference25 articles.
1. Decycling graphs
2. Niven I., Zuckerman H. S., An Introduction to the Theory of Numbers (5th ed.).John Wiley and Sons, New York, (1991).
3. New bounds on the size of the minimum feedback vertex set in meshes and butterflies
4. Festa P., Pardalos P. M., Resende M. G. C., Feedback set problems. Handbook of Combinatorial Optimization (Du D.-Z., Pardalos P.M. eds.), Vol. A, Kluwer, Dordrecht, pp. 209, (1999).
5. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem