Feedback Vertex Set in Split-Stars and Alternating Groups

Abstract

The feedback vertex set F of a graph G is a subset of vertices such that the removal of F from G induces an acyclic subgraph. In this paper, we study the feedback vertex set problem on the directed and undirected spilt-stars and alternating group graphs separately. We give upper and lower bounds to the minimum feedback vertex set on the n-dimensional spilt-stars and n-dimensional alternating group graphs.