Release Time:2019-03-12  Hits:

Indexed by: Journal Article

Date of Publication: 2018-07-01

Journal: ARS COMBINATORIA

Included Journals: SCIE

Volume: 140

Page Number: 397-409

ISSN: 0381-7032

Key Words: Feedback Vertex Set; Feedback Number; Knodel Graph; A-cyclic Subgraph

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. Use f (n) to denote the minimum cardinality over all feedback vertex sets of Knodel graph W-3,W-n. In this paper, we study the feedback number of Knodel graph W-3,W-n. We construct an acyclic subset of W-3,W-n and prove that f (n) = [n+2/4] for even n >= 8.