Stress of a graph and its computation

Abstract

Stress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices, an interesting expression and also an algorithm are presented to find stress using adjacency matrix. The results and algorithm are suitably adopted to obtain betweenness centrality measure. Further results are extended to the cases of Cartesian product (Formula presented.) of graphs, corona graph (Formula presented.) and their special cases.