Joulwal of Statistical Physics, Vol. 87. Nos. 3/4, 1997. p. 909-913.
Let Tk be a Ibrwarding tree of degree k where each vertex other than the origin has k children and one parent and the origin has k children but no parent (k>/2). Define G to be the graph obtained by adding to Tk nearest neighbor bonds connecting the vertices which are in the same generation...