Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-23T10:21:21.469Z Has data issue: false hasContentIssue false
  • English
  • Français

Adding and Reversing Arcs in Semicomplete Digraphs

Published online by Cambridge University Press:  01 March 1998

JØRGEN BANG-JENSEN  and
TIBOR JORDÁN
JØRGEN BANG-JENSEN
Affiliation:
Department of Mathematics and Computer Science, Odense University, Campusvej 55 DK-5230 Odense, Denmark (e-mail: [email protected] and [email protected])
TIBOR JORDÁN
Affiliation:
Department of Mathematics and Computer Science, Odense University, Campusvej 55 DK-5230 Odense, Denmark (e-mail: [email protected] and [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

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[ges ]3k−1, then ak(T)=rk(T). We also show that this bound on n is best possible.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 1 , March 1998 , pp. 17 - 25
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)