| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420146 | Discrete Applied Mathematics | 2012 | 8 Pages |
Abstract
The acyclic disconnection of a digraph DD is the maximum number of components that can be obtained by deleting from DD the set of arcs of an acyclic subdigraph. We give bounds for the acyclic disconnection of strongly connected bipartite tournaments and of regular bipartite tournaments. For the latter case, we exhibit an infinite family of tournaments with acyclic disconnection equal to 4.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
A.P. Figueroa, B. Llano, M. Olsen, E. Rivera-Campo,