Author:
Wang Yijin,Zhang Xinyue,Zhang Sijia
Abstract
A subset F ⊂ V(G) is called a feedback vertex set if the subgraph G−F is acyclic. The minimum cardinality of a feedback vertex set is called the feedback number of G, which is proposed by Beineke and Vandell [1]. In this paper, we consider a particular topology graph called Möbius ladders M2n. We use f(M2n) to denote the feedback number of M2n. This paper proves that f (M2n) = [n+1/2], n≥3.
Reference20 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