Extremal graphs in connectivity augmentation

Research output: Contribution to journalArticle

2 Citations (Scopus)


Let A(n, k, t) denote the smallest integer e for which every k-connected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity. For undirected vertex-connectivity we determine A(n, k, 1) for all values of n and k. We also describe the graphs that attain the extremal values.

Original languageEnglish
Pages (from-to)179-193
Number of pages15
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - Jul 1999



  • Connectivity
  • Directed graphs
  • Edge-splitting
  • Graph connectivity augmentation

ASJC Scopus subject areas

  • Geometry and Topology

Cite this