  The spectral properties of the adjacency (connectivity) and distance matrix
for various types of networks: exponential, scale-free (Albert--Barabasi) and
classical random ones (Erdos--Renyi) are evaluated. The graph spectra for dense
graph in the Erdos-Renyi model are derived analytically.
