Betweenness Centrality of Some Complementary Prism Graphs
There are a lot of centrality measures that have been introduced for networks. One of them is betweenness centrality. It is a measure of the influence of a vertex over the flow of information between all pairs of vertices. This information flows over the shortest paths between these vertices. The fa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Suleyman Demirel University
2019-08-01
|
| Series: | Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi |
| Subjects: | |
| Online Access: |
http://static.dergipark.org.tr:8080/article-download/9837/acfd/04cb/5d61076682fcf.pdf?
|
| Summary: | There are a lot of centrality measures that have been introduced for networks. One of them is betweenness centrality. It is a measure of the influence of a vertex over the flow of information between all pairs of vertices. This information flows over the shortest paths between these vertices. The fact that any vertex has a high value of centrality indicates that what level this vertex is in connection with vertices which are not adjacent with each other. Since this vertex controls flows of information, it has a potential role in the network. In this paper, we study on the betweenness centrality of some complementary prism graphs. |
|---|---|
| ISSN: | 1300-7688 1308-6529 |