Square root stress-sum index for graphs

• Mahesh, K. B. ^[2] ; Rajendra, R. ^[1] ; Reddy, P. Siva Kota
  1. [1] Mangalore University

     Mangalore University

     India

     
  2. [2] Dr. P. Dayananda Pai- P. Sathisha Pai, Government First Grade College, Mangalore, Carstreet.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 40, Nº. 4, 2021, págs. 927-936
• Idioma: inglés
• DOI: 10.22199/issn.0717-6279-4362
• Enlaces
  • Texto completo
• Resumen

  • 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.

• Referencias bibliográficas
  • K. Bhargava, N.N. Dattatreya, and R. Rajendra, “On stress of a vertex in a graph”, Palestine journal of mathematics, accepted for publication.
  • K. C. Das, I. Gutman, I. Milovanović, E. Milovanović, and B. Furtula, “Degree-based energies of graphs”, Linear algebra and its applications,...
  • F. Harary, Graph theory. Reading, MA: Addison Wesley, 1972.
  • M. Indhumathy, S. Arumugam, V. Baths, and T. Singh, “Graph theoretic concepts in the study of biological networks”, in Applied analysis in...
  • P. Shannon, A. Markiel, O. Ozier, N.S. Baliga, J.T. Wang, D. Ramage, N. Amin, B. Schwikowski, and T. Idekar, “Cytoscape: a software environment...
  • A. Shimbel, “Structural parameters of communication networks”, The bulletin of mathematical biophysics, vol. 15, pp. 501-507, 1953. https://doi.org/10.1007/BF02476438