N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Random Graph Model for Massive Graphs - Aiello, Chung, Lu (92 citations) (Correct)
....For example, we show that for # 4 the numbers of components of given sizes can be approximated by a power law as well. 1.3 Previous Work Strictly speaking our model is a special case of random graphs with a given degree sequence for which there is a large literature. For example, Wormald [17] studied the connectivity of graphs whose degrees are in an interval [r, R] where r 3. # Luczak [13] considered the asymptotic behavior of the largest component of a random graph with given degree sequence as a function of the number of vertices of degree 2. His result was further improved by ....
N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167.
A Random Graph Model for Massive Graphs - Aiello, Chung, Lu (2000) (92 citations) (Correct)
....For example, we show that for fi 4 the numbers of components of given sizes can be approximated by a power law as well. 1.3 Previous Work Strictly speaking our model is a special case of random graphs with a given degree sequence for which there is a large literature. For example, Wormald [17] studied the connectivity of graphs whose degrees are in an interval [r; R] where r 3. Luczak [13] considered the asymptotic behavior of the largest component of a random graph with given degree sequence as a function of the number of vertices of degree 2. His result was further improved by ....
N. C. Wormald, The asymptotic connectivity of labeled regular graphs, J. Comb. Theory (B) 31 (1981), 156-167.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC