Is there any result that relates the minimum degree of a geometric random graph to its k-vertex connectivity? I read papers where they pose the condition $$d_{\rm min} \geq k$$ to imply that the graph is k-connected (vertex connectivity). Is that an approximation or an asymptotic result? In my case, I need, if not an exact result, a lower bound

$$P({\rm graph~is~connected}) \geq f(d_{\rm min}).$$

I could not find references so far.


1 Answer 1


Does this help? http://www.maths.bath.ac.uk/~masmdp/ab/kcon.html


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.