In this article we establish new results on the components of the principal eigenvector in an undirected graph. Those results are particularly significant in relation to the concept of centrality in social networks. In particular degree centrality and eigenvector centrality are compared. We find further conditions, based on the spectral radius, on which nodes with highest degree centrality are also the most eigencentral.