2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/163977The 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.9 pages, 3 figures in 7 epos files, for ICCS 2008Disordered Systems and Neural NetworksStatistical Mechanicstext