TY - JOUR
T1 - The stress of a graph
AU - Poojary, Raksha
AU - Bhat, Arathi K.
AU - Arumugam, S.
AU - Karantha, Manjunatha Prasad
N1 - Funding Information:
Manjunatha Prasad Karantha acknowledges the support by Science and Engineering Research Board (DST, Government of India) under MATRICS (MTR/2018/000156) and CRG (CRG/2019/000238) schemes. The authors are thankful to the anonymous reviewers for their suggestions and comments which resulted in substantial improvement in the paper.
Publisher Copyright:
© 2023 Azarbaijan Shahid Madani University.
PY - 2023
Y1 - 2023
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85136592628&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85136592628&partnerID=8YFLogxK
U2 - 10.22049/CCO.2021.27320.1231
DO - 10.22049/CCO.2021.27320.1231
M3 - Article
AN - SCOPUS:85136592628
SN - 2538-2128
VL - 8
SP - 53
EP - 65
JO - Communications in Combinatorics and Optimization
JF - Communications in Combinatorics and Optimization
IS - 1
ER -