On the strength of connectedness of a random graph (Q3286851): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Maximal Flow Through a Network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3267900 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3286850 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02066689 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146162554 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the strength of connectedness of a random graph |
scientific article |
Statements
On the strength of connectedness of a random graph (English)
0 references
1961
0 references
topology
0 references
