Abstract
The process of ranking molecular chemical compounds or large networks is a challenging task as they are degenerate in nature. A novel idea is to apply graph theory-based concepts like centrality measures and topological indices based on them to predict the rank of each molecular chemical graph. The stress of a vertex in a graph is a measure of vertex centrality and is defined as the number of shortest paths that pass through it. Recently, some topological indices based on the stress of vertices in a graph have been defined. In this article, we obtain the stress-sum index of some standard class of graphs with diameter two.
| Original language | English |
|---|---|
| Pages (from-to) | 281-289 |
| Number of pages | 9 |
| Journal | International Journal of Applied Mathematics |
| Volume | 38 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 2025 |
All Science Journal Classification (ASJC) codes
- General Mathematics
- Computational Theory and Mathematics