On the spread of random graphs
<p style="text-align:justify;"> The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distrib...
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Journal article |
| Publicerad: |
Cambridge University Press
2014
|