Relations among Shakespeare's characters: an analysis in terms of centrality measures and new tecniques from graph theory

This work analyzes some aspects of two problems in graph theory: centrality measures that allow us to detect the most important group of nodes in a network and the clustering of a graph in coherent sub-communities. We propose two new centrality measures that are the results of a new point of view and we suggest a new algorithm to detect communities. We apply all the results to analyze drama, in particular five Shakespeare's plays.