Feedback vertex sets and cyclically reducible graphs
Journal of the ACM (JACM)
Maximum induced trees in graphs
Journal of Combinatorial Theory Series B
On the feedback vertex set problem in permutation graphs
Information Processing Letters
Journal of Graph Theory
Almost exact minimum feedback vertex set in meshes and butterflies
Information Processing Letters
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Feedback vertex set in hypercubes
Information Processing Letters
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
Information Processing Letters
Minimum feedback vertex sets in shuffle-based interconnection networks
Information Processing Letters
Hi-index | 0.09 |
A subset of vertices of a graph G is called a feedback vertex set of G if its removal results in an acyclic subgraph. Let f(d,n) denote the minimum cardinality over all feedback vertex sets of the de Bruijn digraph B(d,n). This paper proves that for any integers d=2 and n=2f(d,n)={1n@?i|nd^i@f(ni)for 2@?n@?4;d^nn+O(nd^n^-^4)for n=5, where i|n means i divides n, and @f(i) is the Euler totient function.