Name
Abstract | ||
|---|---|---|
Let U(n,M) be a graph chosen at random from the family of all unlabeled graphs with n vertices and M edges. In the paper we study the asymptotic behavior of U(n,M) when n --> infinity. In particular, we show how properties of U(n,M) could be derived from analogous properties of a labeled random graph. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1002/jgt.3190150307 | Journal of Graph Theory |
Keywords | Field | DocType |
unlabeled random graph,random graph | Topology,Automorphism group,Random regular graph,Graph,Discrete mathematics,Combinatorics,Random graph,Vertex (geometry),Matching (graph theory),Asymptotic analysis,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 3 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Łuczak | 1 | 225 | 40.26 |