@article { author = {Poojary, Raksha and K, Arathi Bhat and Arumugam, Subramanian and Karantha, Manjunatha Prasad}, title = {The stress of a graph}, journal = {Communications in Combinatorics and Optimization}, volume = {8}, number = {1}, pages = {53-65}, year = {2023}, publisher = {Azarbaijan Shahid Madani University}, issn = {2538-2128}, eissn = {2538-2136}, doi = {10.22049/cco.2021.27320.1231}, abstract = {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$.}, keywords = {Centrality measure,ranking of vertices,path,tree,block-graph}, url = {http://comb-opt.azaruniv.ac.ir/article_14282.html}, eprint = {http://comb-opt.azaruniv.ac.ir/article_14282_09edb34f88f77b9f57f5d03d3f269826.pdf} }