vertex betweenness centrality of corona graphs and unicyclic graphs

The idea of centrality measurements is quite appropriate for determining the important vertices or edges in a network. a vertex in a network may be an important vertex depending on its angle of assumption. there are many centrality measurements to find the characteristics of a vertex in a network. betweenness centrality is an important variant of centrality measurement for analyzing complex networks based on shortest paths. the betweenness centrality of a node point u is the sum of the fraction which has the number of shortest paths between any two node points v and w as denominator and the number of the shortest paths passing through the vertex u between them as numerator. this paper describes some theoretical results relating to the betweenness centrality and relative betweenness centrality of different types of corona graphs (pn⊙pm, pn⊙km, cn⊙km, cn⊙pm, cn⊙cm and cn⊙kl,m) and unicyclic graphs (a(n, k, l), b(n, k, l), d(n, k, l) and e(n, k, l)).