论文信息 - The acyclic disconnection of a digraph

The acyclic disconnection of a digraph

Abstract 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.

Victor Neumann-Lara

[1] Victor Neumann-Lara. Vertex critical 4-dichromatic circulant tournaments , 1997, Discret. Math..

[2] H. Meyniel,et al. Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs , 1983 .

[3] Victor Neumann-Lara,et al. On the minimum size of tight hypergraphs , 1992, J. Graph Theory.

[4] Victor Neumann-Lara,et al. The dichromatic number of a digraph , 1982, J. Comb. Theory, Ser. B.

[5] Jorge Urrutia,et al. Vertex critical r-dichromatic tournaments , 1984, Discret. Math..

[6] Brian Alspach,et al. Cycles of Each Length in Regular Tournaments , 1967, Canadian Mathematical Bulletin.

[7] Paul Erdös,et al. Some extremal results in cochromatic and dichromatic theory , 1991, J. Graph Theory.

[8] Victor Neumann-Lara. The 3 and 4-dichromatic tournaments of minimum order , 1994, Discret. Math..

[9] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[10] Gregory Gutin,et al. Paths and cycles in extended and decomposable digraphs, , 1997, Discret. Math..