Name
Abstract | ||
|---|---|---|
Starting with n labeled vertices and no edges, introduce edges, one at a time, so as to obtain a sequence of graphs each having no vertex of degree greater than f . The latter are called f -graphs. At each step the edge to be added is selected with equal probability from among those edges whose addition would not violate the f -degree restriction. This procedure is called the Random f-Graph Process (Rf-GP) of order n . Here we determine some properties of the numbers of paths, cycles and components for the R2-GP and provide the vertex degree distribution for all f ⩾ 2. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0166-218X(95)00008-F | Discrete Applied Mathematics |
Keywords | Field | DocType |
random f-graph process,kinetic approach,degree distribution,kinetics | Discrete mathematics,Differential equation,Combinatorics,Random graph,Vertex (geometry),Vertex (graph theory),Cycle graph,Neighbourhood (graph theory),Degree (graph theory),Multiple edges,Mathematics | Journal |
Volume | Issue | ISSN |
67 | 1-3 | Discrete Applied Mathematics |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Krystyna T. Balinska | 1 | 8 | 5.35 |
| Henryk Galina | 2 | 1 | 1.45 |
| Louis V. Quintas | 3 | 22 | 11.30 |
| Jerzy Szymański | 4 | 0 | 0.34 |