The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges (Q5668827)
From MaRDI portal
scientific article; zbMATH DE number 3400933
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges |
scientific article; zbMATH DE number 3400933 |
Statements
1972
0 references
The Probability of Connectedness of an Unlabelled Graph Can Be Less for More Edges (English)
0 references
