A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
2015
Discrete Dynamics in Nature and Society
We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here strengthen recent work by the Krishnan et al.
doi:10.1155/2015/982094
fatcat:o72dtzp34ncszl2cyly4njx5q4