𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independence free graphs and vertex connectivity augmentation

✍ Scribed by Bill Jackson; Tibor Jordán

Book ID
108167363
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
568 KB
Volume
94
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum local-vertex-connectivity
On the minimum local-vertex-connectivity augmentation in graphs
✍ Hiroshi Nagamochi; Toshimasa Ishii 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Given a graph G and target values r(u; v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u; v) internally disjoint paths between each pair of vertices u and v. We show that the pr

Extremal graphs in connectivity augmenta
Extremal graphs in connectivity augmentation
✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected 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