Open AccessSquare root stress-sum index for graphs
Author(s) -
K. B. Mahesh,
R. Rajendra,
P. Siva Kota Reddy
Publication year - 2021
Publication title -
proyecciones
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.226
H-Index - 12
eISSN - 0717-6279
pISSN - 0716-0917
DOI - 10.22199/issn.0717-6279-4362
Subject(s) - combinatorics , vertex (graph theory) , topological index , mathematics , centrality , index (typography) , discrete mathematics , square root , graph , geodesic , computer science , mathematical analysis , geometry , world wide web
The stress of a vertex is a node centrality index, which has been introduced by Shimbel (1953). The stress of a vertex in a graph is the number of geodesics (shortest paths) passing through it. In this paper, we introduce a new topological index for graphs called square root stress sum index using stresses of vertices. Further, we establish some inequalities, prove some results and compute stress-sum index for some standard graphs.