Q60. Use NodeXL to compute betweenness, closeness, and Eigenvector centralities of the network shown below (Excel file here). Label the vertices with these.

  1. Rearrange the edges so as to get the largest value for betweenness centrality for vertex A
  2. Rearrange the edges so as to get the largest value for closeness centrality for vertex A
  3. Rearrange to get largest Eigenvector centrality
q0060-a.gif

Tag:Computational Thinking | w01 | w02 | w03 | w04 | w05 | w06 | w07 | w08 | w09 | w10 | w11 | w12

Tag:Human Centred Design | w01 | w02 | w03 | w04 | w05 | w06 | w07 | w08 | w09 | w10 | w11 | w12