The first cycles in an evolving graph (Q910415): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(89)90087-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966433910 / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The first cycles in an evolving graph |
scientific article |
Statements
The first cycles in an evolving graph (English)
0 references
1989
0 references
Analytical methods based on generating functions are used to prove various results on waiting times for cycles in a random graph process with successively added edges. Cycle lengths and other properties are also investigated. Asymptotic results are given for graphs of large order.
0 references
graph evolution
0 references
generating functions
0 references
random graph process
0 references
