Connectivity of the uniform random intersection graph (Q1044989): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficiently covering complex networks with cliques of similar vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Component evolution in a secure wireless sensor network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The degree of a typical vertex in generalized random intersection graph models / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The vertex degree distribution of random intersection graphs / rank | |||
Normal rank | |||
Latest revision as of 07:52, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of the uniform random intersection graph |
scientific article |
Statements
Connectivity of the uniform random intersection graph (English)
0 references
15 December 2009
0 references
random intersection graph
0 references
key predistribution
0 references
wireless sensor network
0 references
0 references
