𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Highly connected random geometric graphs

✍ Scribed by Paul Balister; Béla Bollobás; Amites Sarkar; Mark Walters

Book ID
108112750
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
783 KB
Volume
157
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Geometric Graphs
Random Geometric Graphs
✍ Chris Cannings 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB
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

When are random graphs connected
When are random graphs connected
✍ S. Kalikow; B. Weiss 📂 Article 📅 1988 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 432 KB