The stress of a graph

Stress is an important centrality measure of graphs applicableto the study of social and biological networks. We study the stress of paths, cycles, fans andwheels. We determine the stress of a cut vertex of a graph G, when G has at most two cutvertices. We have also identified the graphs with minimum stress and maximum stress in thefamily of all trees of order $n$ and in the family of all complete bipartite graphs of order n.