TY - JOUR
T1 - Stress of a graph and its computation
AU - Poojary, Raksha
AU - Arathi Bhat, K.
AU - Arumugam, Subramanian
AU - Karantha, Manjunatha Prasad
N1 - Publisher Copyright:
© 2023 The Author(s). Published with license by Taylor & Francis Group, LLC.
PY - 2023
Y1 - 2023
N2 - Stress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices, an interesting expression and also an algorithm are presented to find stress using adjacency matrix. The results and algorithm are suitably adopted to obtain betweenness centrality measure. Further results are extended to the cases of Cartesian product (Formula presented.) of graphs, corona graph (Formula presented.) and their special cases.
AB - Stress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices, an interesting expression and also an algorithm are presented to find stress using adjacency matrix. The results and algorithm are suitably adopted to obtain betweenness centrality measure. Further results are extended to the cases of Cartesian product (Formula presented.) of graphs, corona graph (Formula presented.) and their special cases.
UR - https://www.scopus.com/pages/publications/85167985618
UR - https://www.scopus.com/inward/citedby.url?scp=85167985618&partnerID=8YFLogxK
U2 - 10.1080/09728600.2023.2243630
DO - 10.1080/09728600.2023.2243630
M3 - Article
AN - SCOPUS:85167985618
SN - 0972-8600
VL - 20
SP - 200
EP - 208
JO - AKCE International Journal of Graphs and Combinatorics
JF - AKCE International Journal of Graphs and Combinatorics
IS - 2
ER -