Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) (Q3068767): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Degree distribution of a typical vertex in a general random intersection graph / 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: RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect matchings in random uniform hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Poisson Approximation of the Number of Cliques in Random Intersection Graphs / rank | |||
Normal rank | |||
Latest revision as of 16:39, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) |
scientific article |
Statements
Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) (English)
0 references
17 January 2011
0 references
random intersection graph
0 references
equivalence
0 references
graph properties
0 references
