𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Towards minimum k-geodetically connected graphs

✍ Scribed by Ján Plesník

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
162 KB
Volume
41
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum K-hamiltonian graphs
Minimum K-hamiltonian graphs
✍ W. W. Wong; C. K. Wong 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB
k-shredders in k-connected graphs
k-shredders in k-connected graphs
✍ Yoshimi Egawa 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract For a graph __G__, a subset __S__ of __V__(__G__) is called a shredder if __G__ − __S__ consists of three or more components. We show that if __k__ ≥ 4 and __G__ is a __k__‐connected graph, then the number of shredders of cardinality __k__ of __G__ is less than 2|__V__(__G__)|/3 (we sho

Minimally (k, k)-edge-connected graphs
Minimally (k, k)-edge-connected graphs
✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

Minimal k-arc connected graphs
Minimal k-arc connected graphs
✍ D. R. Fulkerson; L. S. Shapley 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB