Logo
Logo
Campo de búsqueda / búsqueda general

 
Autor
Título
Tema

Título: On the acyclic disconnection of multipartite tournaments
Autor(es): GOMORA FIGUEROA, ANA PAULINA
LLANO PEREZ, BERNANRDO
OLSEN, MIKA
RIVERA OCAMPO, EDUARDO
Temas: Modelos acíclicos
Matemáticas
Fecha: 2012
Editorial: Ámsterdam : Elsevier
Citation: Discrete Appliet Mathematics, vol. 160, Issues 10–11, July 2012
Resumen: The acyclic disconnection of a digraph D is the maximum number of components that can be obtained by deleting from D 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.
URI: http://ilitia.cua.uam.mx:8080/jspui/handle/123456789/562
Aparece en las colecciones:Artículos

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
On the acyclic disconnection of multipartie.pdf233.51 kBAdobe PDFVisualizar/Abrir


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.