Author/Authors :
Poojary, Raksha Department of Data Science - Prasanna School of Public Health - Manipal Academy of Higher Education - Manipal, Karnataka, India , Arathi Bhat, K Department of Mathematics - Manipal Institute of Technology - Manipal Academy of Higher Education - Manipal, Karnataka, India , Arumugam, S n-CARDMATH - Kalasalingam Academy of Research and Education - Krishnankoil, Tamilnadu, India , Karantha, Manjunatha Prasad Centre for Advanced Research in Applied Mathematics and Statistics - Manipal Academy of Higher Education - Manipal, Karnataka, India
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 , stress , ranking of vertices , path , tree , block-graph
