Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> ) (Q3068767): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 0910.5311 / rank | |||
Normal rank | |||
Revision as of 14:53, 19 April 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
