DOI: 10.12732/ijam.v38i2.8
STRESS-SUM INDEX OF GRAPHS
WITH DIAMETER TWO
Niveditha 1, K Arathi Bhat 2,§, Shahistha Hanif 3
1,2,3 Department of Mathematics
Manipal Institute of Technology
Manipal Academy of Higher Education, Manipal
Karnataka, INDIA-576104
Abstract. The process of ranking molecular chemical compounds or large net works 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.
How
to cite this paper?
DOI: 10.12732/ijam.v38i2.8
Source: International Journal of
Applied Mathematics
ISSN printed version: 1311-1728
ISSN on-line version: 1314-8060
Year: 2025
Volume: 38
Issue: 2
References
[1] K.
Bhargava, N. N. Dattatreya and R. Rajendra, On stress of a vertex in a graph,
Palest. J. Math., 12, No 3 (2023), 15-25.
[2] R. Rajendra, P. Siva Kota Reddy, C. N. Harshavardhana, Stress-sum index for graphs, Scientia Magna, 15 (2020), 94–103.
[3] R. Rajendra, P. S. K. Reddy and I. N. Cangul, Stress indices of graphs, Advn. Stud. Contemp. Math., 31, No 2 (2021), 163-173.
[4] R. Poojary, K. A. Bhat, S. Arumugam, and M. P. Karantha, Stress of wheel related graphs, Nat. Acad. Sci. Lett., 45, No 5 (2022), 427–431.
[5] R. Poojary, K. A. Bhat, S. Arumugam, and M. P. Karantha, The stress of a graph, Commun. Comb. Optim., 8, No 1 (2023), 53–65.
[6] R. Poojary, K. A. Bhat, S. Arumugam, and M. P. Karantha, Stress of a graph and its computation, AKCE Int. J. Graphs Comb., 20, No 2 (2023), 200–208.
[7] A. Shimbel, Structural parameters of communication networks, Bull. Math. Biophys., 15 (1953), 501-506.
[8] D. B. West, Introduction to Graph Theory, Prentice Hall Upper, Saddle River (2001).
IJAM
o Home
o Contents