𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Indestructive deletions of edges from graphs

✍ Scribed by B Bollobás; D.L Goldsmith; D.R Woodall

Book ID
107884131
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
585 KB
Volume
30
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Properties of edge-deleted distance stab
Properties of edge-deleted distance stable graphs
✍ Klemm, Karen; Winters, Steven J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u-v path in G. The distance of a vertex v of G is the sum of the distances from v to the vertices of G. For a vertex v in a 2-edge-connected graph G, we define the edge-deleted distance of v as the maximum