The nowhere-zero eigenbasis problem for a graph

Using the implicit function theorem it is shown that for any n distinct real numbers λ1,λ2,…,λn, and for each connected graph G of order n, there is a real symmetric matrix A whose graph is G, the eigenvalues of A are λ1,…,λn, and every entry in each eigenvector of A is nonzero.