We use the generating function formalism to calculate the fractal dimensions for the percolating cluster at criticality in Erdős–Rényi (ER) and random scale free (SF) networks, with degree distribution P(k)=ck−λ. We show that the chemical dimension is dl=2 for ER and SF networks with...

A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scale-free networks embedded by the suggested algorithm are...