Further Results on Betweenness Centrality of Graphs
نویسندگان
1 Ferdowsi University of Mashhad, I R Iran
doi
10.22052/ijmc.2018.108515.1327چکیده
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
