For the composite graph H(n; μ, K, P, α), absence of isolated nodes and connectivity both undergo a sharp zero-one transition when the minimum mean degree nΛ_m crosses log n.
Connectivity of inhomogeneous random key graphs in tersecting inhomogeneous Erd˝ os- R´ enyi graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Secure Connectivity of Heterogeneous Wireless Sensor Networks Under a Heterogeneous On-Off Channel Model
For the composite graph H(n; μ, K, P, α), absence of isolated nodes and connectivity both undergo a sharp zero-one transition when the minimum mean degree nΛ_m crosses log n.