Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
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 r...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/982094 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562755189604352 |
|---|---|
| author | Y. Tang Q. L. Li |
| author_facet | Y. Tang Q. L. Li |
| author_sort | Y. Tang |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-a35ddfe5d6d0494a8ec6780365abfb94 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-a35ddfe5d6d0494a8ec6780365abfb942025-02-03T01:21:49ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/982094982094Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric GraphsY. Tang0Q. L. Li1College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, ChinaCollege of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, ChinaWe 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.http://dx.doi.org/10.1155/2015/982094 |
| spellingShingle | Y. Tang Q. L. Li Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs Discrete Dynamics in Nature and Society |
| title | Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs |
| title_full | Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs |
| title_fullStr | Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs |
| title_full_unstemmed | Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs |
| title_short | Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs |
| title_sort | zero one law for connectivity in superposition of random key graphs on random geometric graphs |
| url | http://dx.doi.org/10.1155/2015/982094 |
| work_keys_str_mv | AT ytang zeroonelawforconnectivityinsuperpositionofrandomkeygraphsonrandomgeometricgraphs AT qlli zeroonelawforconnectivityinsuperpositionofrandomkeygraphsonrandomgeometricgraphs |