The acyclic disconnection of a digraph Original Research Article

In this paper we introduce a numerical invariant of digraphs which generalizes that of the number of connected components of a graph. The acyclic disconnection ω(D) of a digraph D is the minimum number of (weakly) connected components of the subdigraphs obtained from D by deleting an acyclic set of arcs. We state some results about this invariant and compute its value for a variety of circulant tournaments. Relations between the dichromatic number and the acyclic disconnection of digraphs are explored and a generalization of the second invariant is presented.