# Eigenvector centrality

I was wondering if you can calculate eigenvector centrality with undirected graphs and if you can, what is the best means of doing so. I understand how to calculate the adjacency matrix and how to calculate its eigenvector (spectral) decomposition, I just am unaware as to how to combine this parts in order to calculate eigenvector centrality. Thanks in advance!

-
What's the matter with the "using the adjacency matrix to compute eigenvector centrality" section of the wikipedia article? en.wikipedia.org/wiki/Centrality Perhaps you are considering a more general notion than this? – Jon Bannon Jul 20 '10 at 14:46
Looking at en.wikipedia.org/wiki/Centrality#Eigenvector_centrality it seems that it suffices to find an eigenvector of the largest eigenvalue of the adjacency matrix. Then the eigenvector centrality of the $i$-th vertex is the $i$-th coordinate of such a vector. – Daniel Litt Jul 20 '10 at 14:46