Stress of a graph and its computation

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