𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Detachment of Vertices of Graphs Preserving Edge-Connectivity

✍ Scribed by Fleiner, Balázs

Book ID
118199601
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
180 KB
Volume
18
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly edge-connected detachments of gra
Highly edge-connected detachments of graphs and digraphs
✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

## Abstract Let __G__ = (__V__,__E__) be a graph or digraph and __r__ : __V__ → __Z__~+~. An __r__‐detachment of __G__ is a graph __H__ obtained by ‘splitting’ each vertex ν ∈ __V__ into __r__(ν) vertices. The vertices ν~1~,…,ν~__r__(ν)~ obtained by splitting ν are called the __pieces__ of ν in __H