compute eigenvector centrality
(optional) a vertex of G
EigenvectorCentrality returns the eigenvector centrality for a specified vertex in the given graph G, or if no vertex is specified, returns a list of the eigenvector centralities for each vertex in G.
Let A be the adjacency matrix of G. The eigenvector centrality of a vertex v in G is the normalized value of the corresponding entry in the eigenvector of A which corresponds with the largest eigenvalue of A.
Compute the eigenvector centrality for a specified graph.
G ≔ Graph⁡6,1,3,1,6,2,6,2,4,3,6,4,6,4,5,5,6
G≔Graph 1: an undirected graph with 6 vertices and 8 edge(s)
The GraphTheory[EigenvectorCentrality] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document