| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903452 | Electronic Notes in Discrete Mathematics | 2017 | 8 Pages |
Abstract
Betweenness centrality is a widely used to measure the potential of a node to control the communication over the network. It measures the extent to which a vertex is part of the shortest paths between pairs of other vertices in a graph. In this paper, we establish expression for betweenness centrality in Cartesian product of graphs. And investigate the same on certain graphs such as Hamming graphs, hypercubes, Cartesian product of path and cycle.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Sunil Kumar R., Kannan Balakrishnan,