Adding and Reversing Arcs in Semicomplete Digraphs

Jørgen Bang-Jensen, T. Jordán

Research output: Contribution to journalArticle

7 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)17-25
Number of pages9
JournalCombinatorics Probability and Computing
Volume7
Issue number1
Publication statusPublished - 1998

Fingerprint

Digraph
Arc of a curve
Denote
Reversal

ASJC Scopus subject areas

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

Cite this

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

In: Combinatorics Probability and Computing, Vol. 7, No. 1, 1998, p. 17-25.

Research output: Contribution to journalArticle

@article{e3a270fddb924e79afaeb3d293f0e757,
title = "Adding and Reversing Arcs in Semicomplete Digraphs",
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 ≥ 3k -1, then ak(T) = rk(T). We also show that this bound on n is best possible.",
author = "J{\o}rgen Bang-Jensen and T. Jord{\'a}n",
year = "1998",
language = "English",
volume = "7",
pages = "17--25",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "1",

}

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 -