𝔖 Bobbio Scriptorium
✦   LIBER   ✦

k-Connectivity in Random Graphs

✍ Scribed by Erdös, P.; Kennedy, J.W.

Book ID
123442948
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
359 KB
Volume
8
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-connectivity in random undirected grap
k-connectivity in random undirected graphs
✍ John H Reif; Paul G Spirakis 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 591 KB

This paper concerns vertex connectivity in random graphs. We present results bounding the cardinality of the biggest k-block in random graphs of the G,~p model, for any constant value of k. Our results extend the work of Erd6s and R6nyi and Karp and Tarjan. We prove here that (~.~p, with [9 ~ tin, h

On k-connectivity for a geometric random
On k-connectivity for a geometric random graph
✍ Mathew D. Penrose 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

For n points uniformly randomly distributed on the unit cube in d dimensions, ## Ž . with dG 2, let respectively, denote the minimum r at which the graph, obtained by n n adding an edge between each pair of points distant at most r apart, is k-connected Ž . w x respectively, has minimum degree k

On k-leaf connectivity of a random graph
On k-leaf connectivity of a random graph
✍ Thomasz Luczak 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB

We prove that, in a random graph with n vertices and N = cn log n edges, the subgraph generated by a set of all vertices of degree at least k + 1 is k-leaf connected for c > f . A threshold function for k-leaf connectivity is also found. ## 1. MAIN RESULTS Let G = (V(G),E(G)) be a graph, where V (