On maximal entries in the principal eigenvector of graphs Original Research Article

For an undirected, connected graph it is well known that an eigenvector belonging to the principal eigenvalue of G can be given such that all entries are positive. We ask whether this vector carries information on the structure of the graph and approach this question by investigating the values that can occur in its maximal entry.