A lower bound on the entries of the principal eigenvector of a graph

We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.