The spectra of Erdos-Renyi random graphs have been long studied. We consider random graphs of which each edge is determined by an independent random indicator variable with the expected value not all equal in general. We prove that the eigenvalues of the adjacent matrix and the normalized Laplacian matrix of such random graphs can be approximated by those of the `expectation graph ’.