graph theory – Weighted network centrality measure

I am looking for some references (I could not find much online) and/or technical guidance on the eigenvector centrality. More specifically on its generalization for a weighted network, i.e. how to compute it given the (weighted) adjacency matrix and the relativ eigenvalues. As a follow up question: is there a way to get to such measure using the Laplacian, rather than the adjacency matrix?
Thanks all