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

Original languageEnglish
Pages (from-to)53-65
Number of pages13
JournalCommunications in Combinatorics and Optimization
Issue number1
Publication statusPublished - 2023

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Control and Optimization


Dive into the research topics of 'The stress of a graph'. Together they form a unique fingerprint.

Cite this