Numbers of n-th neighbors and node-to-node distances in growing networks
arXiv:cond-mat/0507127
Abstract
Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated. The functional dependence of the node-to-node distance d_{ij} on the product of connectivities k_ik_j has been also checked. The results of simulations for exponential networks agree with the existing analytical predictions.
5 pages, RevTeX4, 3 figures with 9 eps files, dedicated to Professor Andrzej Z. Maksymowicz on the occasion of his 65th birthday