Original Research Article

Article volume = 2024 and issue = 1

Pages: 9–14

Article publication Date: December 03, 2023

You can download PDF file of the article here: Download

Visited 281 times and downloaded 147 times

Stress Indices of Graphs

Harishchandra S. Ramane and Mallappa P. Mellikeri

Department of Mathematics, Karnatak University, Dharwad -580003, India.

Abstract:

The stress of a vertex is the number of shortest paths passing through it. The stess indices of cycle C_n and of wheel W_{n+1} are existing in terms of odd n and even n separately. In this paper we obtain stress indices of cycle and wheel in terms of single expressions of n. Further we obtain the stress indices of trees considering all its vertices.

Keywords:

Stress of a vertex, Stress indices of graphs, Stress-sum index.

References:
  • [1] S. P. Borgatti, M. G. Everett, A graph-theoretic perspective on centrality, Social Networks, 28 (2006), 466–484. 1
  • [2] K. Das, S. Samanta, M. Pal, Study on centrality measures in social networks: a survey, Soc. Netw. Anal. Min., 8 (2018), 13. 1
  • [3] A. Shimbel, Structaral parameters of communication networks, Bull. Math. Biophys., 15 (1953), 501–507. 1
  • [4] R. Rajendra, P. Siva Kota Reddy, I. N. Cangul, Stress indices of graphs, Adv. Stud. Cont. Math., 31 (2021), 163–173. 1, 3
  • [5] R. Rajendra, P. Siva Kota Reddy, C. N. Harshavardhana, Stress-sum index for graphs, Scientia Magna, 15 (2020), 94–103. 1, 3
  • [6] H. S. Ramane, M. P. Mellikeri, Stress of trees, (2023) (Preprint). 2
Cite this article as:
  • Harishchandra S. Ramane and Mallappa P. Mellikeri, Stress Indices of Graphs, Communications in Combinatorics, Cryptography & Computer Science, 2024(1), PP.9–14, 2023
  • Export citation to BibTeX