Skip to main navigation Skip to search Skip to main content

Stress centrality measure of a vertex

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Centrality measures are the tools used in most of the network analysis to rank the vertices of the network. Depending on different perspectives, many important centrality measures are defined and used for network analysis. Stress is one such important centrality measure of graphs applicable to the study of social and biological networks. In this chapter, we explore the theory describing various properties of the stress centrality measure. Since the adjacency matrix plays an important role in finding the number of shortest paths between a given pair of vertices, an alternate expression to find the stress of a vertex using the adjacency matrix of the graph is presented in this chapter.

Original languageEnglish
Title of host publicationLinear Algebra, Matrices, and Their Applications - International Conference on Linear Algebra and its Applications, ICLAA 2023
EditorsShaun Michael Fallat, Surender K. Jain, Manjunatha Prasad Karantha, Stephen James Kirkland, T.S.S.R.K. Rao
PublisherAmerican Mathematical Society
Pages27-55
Number of pages29
ISBN (Print)9781470477684
DOIs
Publication statusPublished - 2026
EventInternational Conference on Linear Algebra and its Applications, ICLAA 2023 - Manipal, India
Duration: 18-12-202321-12-2023

Publication series

NameContemporary Mathematics
Volume833
ISSN (Print)0271-4132
ISSN (Electronic)1098-3627

Conference

ConferenceInternational Conference on Linear Algebra and its Applications, ICLAA 2023
Country/TerritoryIndia
CityManipal
Period18-12-2321-12-23

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Stress centrality measure of a vertex'. Together they form a unique fingerprint.

Cite this