On the Connectivity of Random k-th Nearest Neighbour Graphs

DOI10.1017/S0963548300001711zbMath0846.05078MaRDI QIDQ4868735

Colin Cooper, Alan M. Frieze

Publication date: 29 September 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

probabilityrandom graphsconnectivity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items (2)

The Erlang weighted tree, a new branching process ⋮ The random bipartite nearest neighbor graphs

Cites Work

• Nearest neighbors and Voronoi regions in certain point processes
• On the strength of connectedness of a random graph

This page was built for publication: On the Connectivity of Random k-th Nearest Neighbour Graphs