Title of article :
The asymptotic number of graphs with a restriction on the maximum degree
Author/Authors :
McKay، نويسنده , , Brendan D. and Wanless، نويسنده , , Ian M. and Wormald، نويسنده , , Nicholas C.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
We find an asymptotic formula for the number of graphs on n vertices with maximum degree at most 1/2n − 1 + n1/2T. The formula is valid when T = T(n)= O(nε) for sufficiently small ε > 0.
Keywords :
Random graph , maximum degree , asymptotic enumeration
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
