Minimum Feedback Vertex Sets in Kautz Networks
Jun‐Ming Xu · Yunchou yu guanli · 2005
For a simple digraph D=(V,E), a subset FV is called a feedback vertex set for D if the induced subgraph by V\F contains no directcycles. The number of vertices in a minimum feedback vertex set is called the feedback number of D. This paper establishes the lower bound and the upper one of the feedback number of Kautz networks K(d,k) by using the minimum orbit, and determines the feedback number for k3.