Configuration graphs with N vertices are considered. The degrees of the vertices are independent identically distributed random variables following the power-law distribution with a positive parameter τ, where τ=τ(N) varies as 0Theorems describing the limiting behaviour of the clustering coefficient for such graphs as N→∞ are obtained.