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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2023-05-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2243630 |
| _version_ | 1827823278083801088 |
|---|---|
| author | Raksha Poojary Arathi Bhat K. Subramanian Arumugam Manjunatha Prasad Karantha |
| author_facet | Raksha Poojary Arathi Bhat K. Subramanian Arumugam Manjunatha Prasad Karantha |
| author_sort | Raksha Poojary |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-03-12T02:08:53Z |
| format | Article |
| id | doaj.art-1df82be7e6e34dda95cc94098d11bcc4 |
| institution | Directory Open Access Journal |
| issn | 0972-8600 2543-3474 |
| language | English |
| last_indexed | 2024-03-12T02:08:53Z |
| publishDate | 2023-05-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | AKCE International Journal of Graphs and Combinatorics |
| spelling | doaj.art-1df82be7e6e34dda95cc94098d11bcc42023-09-06T14:45:48ZengTaylor & Francis GroupAKCE International Journal of Graphs and Combinatorics0972-86002543-34742023-05-0120220020810.1080/09728600.2023.2243630Stress of a graph and its computationRaksha Poojary0Arathi Bhat K.1Subramanian Arumugam2Manjunatha Prasad Karantha3Department of Data Science, Prasanna School of Public Health, Manipal Academy of Higher Education, Manipal, Karnataka, IndiaDepartment of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal, Karnataka, IndiaDepartment of Computer Science and Engineering, Ramco Institute of Technology, Rajapalyam, Tamil Nadu, IndiaDepartment of Data Science, Prasanna School of Public Health, Manipal Academy of Higher Education, Manipal, Karnataka, IndiaAbstractStress 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.https://www.tandfonline.com/doi/10.1080/09728600.2023.2243630Centrality measurestressbetweennessadjacency matrixdistance matrix05C12 |
| spellingShingle | Raksha Poojary Arathi Bhat K. Subramanian Arumugam Manjunatha Prasad Karantha Stress of a graph and its computation AKCE International Journal of Graphs and Combinatorics Centrality measure stress betweenness adjacency matrix distance matrix 05C12 |
| title | Stress of a graph and its computation |
| title_full | Stress of a graph and its computation |
| title_fullStr | Stress of a graph and its computation |
| title_full_unstemmed | Stress of a graph and its computation |
| title_short | Stress of a graph and its computation |
| title_sort | stress of a graph and its computation |
| topic | Centrality measure stress betweenness adjacency matrix distance matrix 05C12 |
| url | https://www.tandfonline.com/doi/10.1080/09728600.2023.2243630 |
| work_keys_str_mv | AT rakshapoojary stressofagraphanditscomputation AT arathibhatk stressofagraphanditscomputation AT subramanianarumugam stressofagraphanditscomputation AT manjunathaprasadkarantha stressofagraphanditscomputation |