𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connectivity threshold of random geometric graphs with Cantor distributed vertices

✍ Scribed by Antar Bandyopadhyay; Farkhondeh Sajadi

Book ID
119373037
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
217 KB
Volume
82
Category
Article
ISSN
0167-7152

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a random graph with immigrating verti
On a random graph with immigrating vertices: Emergence of the giant component
✍ David J. Aldous; Boris Pittel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 186 KB πŸ‘ 2 views

A randomly evolving graph, with vertices immigrating at rate n and each possible edge appearing at rate 1/n, is studied. The detailed picture of emergence of giant components with O n 2/3 vertices is shown to be the same as in the ErdΕ‘s-RΓ©nyi graph process with the number of vertices fixed at n at t

The maximal size of graphs with at most
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices
✍ Mao-cheng Cai πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 502 KB

Let n and k be positive integers satisfying k + 1 s n s 3k -1, and G a simple graph of order n and size e(G) with at most k edge-disjoint paths connecting any two adjacent vertices. In this paper we prove that e(G) s l(n + k)\*/8], and give complete characterizations of the extremal graphs and the e