tlooto
Sign up
Open AccessMathematicsComputer Science

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Michael Molloy, B. Reed

1998.9.1COMBINATORICS PROBABILITY & COMPUTING

DOI: 10.1017/s0963548398003526

tlooto Summary

The size of the giant component in the former case, and the structure of the graph formed by deleting that component is analyzed, which is basically that of a random graph with n′=n−∣C∣ vertices, and with λ′in′ of them of degree i.

Abstract

Abstract is not available.

Citation format

MOLLOY, Michael; REED, B. The size of the giant component of a random graph with a given degree sequence. COMBINATORICS PROBABILITY & COMPUTING, 1998, 7: 295–305.