Infinite locally random graphs
Motivated by copying models of the web graph, Bonato and Janssen [Bonato and Janssen 03] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighborhood, add a new vertex y whose neighbors are exactly X. Iterating this construction yields...
| Главные авторы: | , |
|---|---|
| Формат: | Journal article |
| Опубликовано: |
Taylor and Francis
2006
|