Connectivity of the uniform random intersection graph
From MaRDI portal
Publication:1044989
DOI10.1016/j.disc.2009.03.042zbMath1207.05110arXiv0805.2814MaRDI 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
Related Items
Poisson Approximation of the Number of Cliques in Random Intersection Graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Random intersection graphs with communities, 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, On the complexity of the herding attack and some related attacks on hash functions, On the isolated vertices and connectivity in random intersection graphs, A note on hamiltonicity of uniform random intersection graphs, On the independence number and Hamiltonicity of uniform random intersection graphs, A random intersection digraph: indegree and outdegree distributions, Zero-one law for connectivity in superposition of random key graphs on random geometric graphs, Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints, Degree and clustering coefficient in sparse random intersection graphs, Phase transitions for detecting latent geometry in random graphs, Diameter, connectivity, and phase transition of the uniform random intersection graph, Perfect matchings in random intersection graphs, Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks, Selected Combinatorial Properties of Random Intersection Graphs
Cites Work
