The paper deals with configuration graphs with vertex degrees distributed independently according to the power law. The distribution parameter is either fixed or randomly distributed according to either uniform or truncated normal distribution on a predefined interval (a, b). The assortativity and clustering of these graphs are studied by computer simulation. The estimates of numerical structural characteristics are found, such as the assortativity and clustering coefficients. The obtained results are compared with those known from the literature for real world
complex networks.