Connectivity of the uniform random intersection graph

DOI10.1016/j.disc.2009.03.042zbMath1207.05110arXiv0805.2814OpenAlexW2008111483MaRDI QIDQ1044989

Simon R. Blackburn, Stefanie Gerke

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.2814

zbMATH Keywords

wireless sensor networkrandom intersection graphkey predistribution

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)

Related Items (21)

Graph-theoretic design and analysis of key predistribution schemes ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Degree distribution of an inhomogeneous random intersection graph ⋮ \(k\)-connectivity of uniform \(s\)-intersection graphs ⋮ Phase transition in random intersection graphs with communities ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Perfect matchings in random intersection graphs ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ Phase transitions for detecting latent geometry in random graphs ⋮ A note on hamiltonicity of uniform random intersection graphs ⋮ On the independence number and Hamiltonicity of uniform random intersection graphs ⋮ Zero-one law for connectivity in superposition of random key graphs on random geometric graphs ⋮ Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ On the isolated vertices and connectivity in random intersection graphs ⋮ Poisson Approximation of the Number of Cliques in Random Intersection Graphs ⋮ A random intersection digraph: indegree and outdegree distributions ⋮ Diameter, connectivity, and phase transition of the uniform random intersection graph ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter ⋮ Random intersection graphs with communities

Cites Work

• Efficiently covering complex networks with cliques of similar vertices
• The degree of a typical vertex in generalized random intersection graph models
• The vertex degree distribution of random intersection graphs
• Paths in graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Component evolution in a secure wireless sensor network

This page was built for publication: Connectivity of the uniform random intersection graph