Feedback Numbers of Möbius Ladders

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.