Graf Acak dengan Batas pada Derajat Maksimum

Abstract

Let G ∈ G(n, p) be a graph on n vertices where each pair of vertices is joined independently with probability p for 0 < p < 1 and q = 1 − p. In this case, we introduce weighted random graf G which are assumed to have an exponential distribution with mean 1 λ and variance 1 λ2 for λ > 0. We show that the probability that every vertex of G has degree at most np + b √ npq is equal to 0.595656764.