3 research outputs found
On the minimum number of inversions to make a digraph -(arc-)strong
The {\it inversion} of a set of vertices in a digraph consists of
reversing the direction of all arcs of . We study
(resp. ) which is the minimum number of inversions
needed to transform into a -arc-strong (resp. -strong) digraph and
sinv'_k(n) = \max\{sinv'_k(D) \mid D~\mbox{is a 2kn}\}. We show :
;
for any fixed positive integers and , deciding whether a given
oriented graph satisfies (resp.
) is NP-complete ;
if is a tournament of order at least , then , and ;
for some
tournament of order ;
if is a tournament of order at least (resp. ), then
(resp. );
for every , there exists such that for every tournament on at least
vertices
Making a tournament k-arc-strong by reversing or deorienting arcs
We prove that every tournament T=(V,A) on n2k+1 vertices can be made k-arc-strong by reversing no more than k(k+1)/2 arcs. This is best possible as the transitive tournament needs this many arcs to be reversed. We show that the number of arcs we need to reverse in order to make a tournament k-arc-strong is closely related to the number of arcs we need to reverse just to achieve in- and out-degree at least k. We also consider, for general digraphs, the operation of deorienting an arc which is not part of a 2-cycle. That is we replace an arc xy such that yx is not an arc by the 2-cycle xyx. We prove that for every tournament T on at least 2k+1 vertices, the number of arcs we need to reverse in order to obtain a k-arc-strong tournament from T is equal to the number of arcs one needs to deorient in order to obtain a k-arc-strong digraph from T. Finally, we discuss the relations of our results to related problems and conjectures