### Abstract

Let T be a semicomplete digraph on n vertices. Let a_{k}(T) denote the minimum number of arcs whose addition to T results in a k-connected semicomplete digraph and let r_{k}(T) denote the minimum number of arcs whose reversal in T results in a k-connected semicomplete digraph. We prove that if n ≥ 3k -1, then a_{k}(T) = r_{k}(T). We also show that this bound on n is best possible.

Original language | English |
---|---|

Pages (from-to) | 17-25 |

Number of pages | 9 |

Journal | Combinatorics Probability and Computing |

Volume | 7 |

Issue number | 1 |

Publication status | Published - 1998 |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Mathematics(all)
- Discrete Mathematics and Combinatorics
- Statistics and Probability
- Theoretical Computer Science

### Cite this

*Combinatorics Probability and Computing*,

*7*(1), 17-25.

**Adding and Reversing Arcs in Semicomplete Digraphs.** / Bang-Jensen, Jørgen; Jordán, T.

Research output: Contribution to journal › Article

*Combinatorics Probability and Computing*, vol. 7, no. 1, pp. 17-25.

}

TY - JOUR

T1 - Adding and Reversing Arcs in Semicomplete Digraphs

AU - Bang-Jensen, Jørgen

AU - Jordán, T.

PY - 1998

Y1 - 1998

N2 - Let T be a semicomplete digraph on n vertices. Let ak(T) denote the minimum number of arcs whose addition to T results in a k-connected semicomplete digraph and let rk(T) denote the minimum number of arcs whose reversal in T results in a k-connected semicomplete digraph. We prove that if n ≥ 3k -1, then ak(T) = rk(T). We also show that this bound on n is best possible.

AB - Let T be a semicomplete digraph on n vertices. Let ak(T) denote the minimum number of arcs whose addition to T results in a k-connected semicomplete digraph and let rk(T) denote the minimum number of arcs whose reversal in T results in a k-connected semicomplete digraph. We prove that if n ≥ 3k -1, then ak(T) = rk(T). We also show that this bound on n is best possible.

UR - http://www.scopus.com/inward/record.url?scp=0032331395&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032331395&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0032331395

VL - 7

SP - 17

EP - 25

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1

ER -