The decycling index of a digraph \(D\) is defined to be the minimum number of arcs in a set whose removal from \(D\) leaves an acyclic digraph. In this paper, we obtain some results on the decycling index of bipartite tournaments.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.