On the isolated vertices and connectivity in random intersection graphs
From MaRDI portal
Publication:541188
DOI10.1155/2011/872703zbMath1217.05209OpenAlexW1966248090WikidataQ58655899 ScholiaQ58655899MaRDI QIDQ541188
Publication date: 6 June 2011
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/225984
Related Items
On Some Combinatorial Properties of Random Intersection Graphs ⋮ On the chromatic number of non-sparse random intersection graphs ⋮ Joint probability generating function for degrees of active/passive random intersection graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Component evolution in random intersection graphs
- Connectivity of the uniform random intersection graph
- On the binary expansion of a random integer
- Degree distributions in general random intersection graphs
- On Random Intersection Graphs: The Subgraph Problem
- The vertex degree distribution of random intersection graphs
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models