Feedback Vertex Set of Generalized De Brulin Digraphs GB(d, n)

摘要

A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. In this paper, we consider the feedback vertex set of generalized de Bruijn digraphs GB(d, n). Let f(d, n) denote the minimum cardinality over all feedback vertex sets of the Generalized de Bruijn digraph GB (d, n), we obtain the upper bound of f (d, n) as follows [GRAPHICS]