The acyclic disconnection of a digraph (Q1292866)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The acyclic disconnection of a digraph
scientific article

    Statements

    The acyclic disconnection of a digraph (English)
    0 references
    9 January 2000
    0 references
    The author introduces a new invariant of digraphs: the acyclic disconnection of a digraph \(D\) is the minimum number of connected components of the subgraphs obtained from \(D\) by deleting an acyclic set of arcs. Some results are obtained about this invariant, in general, and for circulant tournaments, in particular.
    0 references
    invariant
    0 references
    digraphs
    0 references
    acyclic disconnection
    0 references
    circulant tournaments
    0 references
    0 references

    Identifiers