The acyclic disconnection of a digraph (Q1292866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The acyclic disconnection of a digraph |
scientific article; zbMATH DE number 1322042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The acyclic disconnection of a digraph |
scientific article; zbMATH DE number 1322042 |
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
0.8585137724876404
0 references
0.8379048109054565
0 references
0.821685254573822
0 references
0.7985875606536865
0 references
0.7829943299293518
0 references
