Stress of a graph and its computation

Stress of a graph and its computation

AbstractStress 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 ar...

Szczegółowa specyfikacja

Opis bibliograficzny
Główni autorzy: Raksha Poojary, Arathi Bhat K., Subramanian Arumugam, Manjunatha Prasad Karantha
Format: Artykuł
Język:English
Wydane: Taylor & Francis Group 2023-05-01
Seria:AKCE International Journal of Graphs and Combinatorics
Hasła przedmiotowe:
Centrality measure
stress
betweenness
adjacency matrix
distance matrix
05C12
Dostęp online:https://www.tandfonline.com/doi/10.1080/09728600.2023.2243630
Opis
Streszczenie:AbstractStress 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: see text] of graphs, corona graph [Formula: see text] and their special cases.
ISSN:0972-8600
2543-3474

Podobne zapisy