Show your work. Include any code snippets you used to generate an answer, using comments in the code to clearly indicate which problem corresponds to which code
Consider the following graph:
1 2 6 7
3 12 8
4 5
11 10 9
Answer the following:
1. (3 points) Without using networkx or other graph analysis packages (though you may use them to check your answer), nd the closeness centrality of vertices 3 and 12.
2. (3 points) Without using networkx or other graph analysis packages (though you may use them to check your answer), nd the eccentricity of vertices 3, 12, and 11.
3. (3 points) Without using networkx or other graph analysis packages (though you may use them to check your answer), nd the clustering coe cient of vertex 3.
4. (3 points) Without using networkx or other graph analysis packages (though you may use them to check your answer), nd the clustering coe cient of the graph.
5. (3 points) Find the betweenness centrality of vertices 3 and 12. You may use networkx or other graph analysis packages, but include the code used to generate your answer in your submission.
6. (3 points) Using networkx, nd the prestige centrality of vertices 3 and 12. Include the code used to generate the answer. (Note that networkx calls the prestige centrality \eigenvector centrality")
7. (3 points) Use Python to create a plot for the degree distribution of this graph. Include the code used to generate the plot as well as the plot in your submission.
Acknowledgements: Homework problems adapted from assignments of Veronika Strnadova-Neeley.
