13 citations · 16 across the 2 of their papers we have counts for
2 papers
math.CO2014★ 3 cited
Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links
Jun Zhao, Osman Yağan, Virgil Gligor
The Eschenauer--Gligor (EG) random key predistribution scheme has been widely recognized as a typical approach to secure communications in wireless sensor networks (WSNs). However,…
math.CO2014★ 13 cited
On -connectivity and minimum vertex degree in random -intersection graphs
Jun Zhao, Osman Yağan, Virgil Gligor
Random -intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random -intersection graph is constructed by first…